Discrete Structures Exam 3 - Fall 2000, Exams of Discrete Structures and Graph Theory

Questions from exam 3 of the discrete structures course offered at carnegie mellon university in the fall of 2000. The exam covers various topics such as arrangements and selections of distinct and identical books, orderings of letters, and recurrence relations.

Typology: Exams

2012/2013

Uploaded on 04/27/2013

ashay
ashay ๐Ÿ‡ฎ๐Ÿ‡ณ

4.1

(15)

196 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CMSC 203 - Discrete Structures - Fall 2000 - Exam 3
1. Suppose I have a collection of 27 Math books, 18 Chemistry books, 22 Biology books,
and 25 Geology books.
a. How many ways can I arrange all these books on a shelf if all the books are distinct?
b. How many ways can I arrange all these books on a shelf if all the books are distinct
and I want the books of each category to be grouped together?
c. How many ways can I select 10 books if all the books of each type are the same?
d. How many ways can I select 10 books if all the books of each type are the same and
I want at least 2 of each type?
2. How many orderings are there of the letters of the words:
a. CHEMISTRY b. MATHEMATICS
3. Suppose 15 people go to eat at a restaurant.
a. How many ways can they arrange themselves around a round table?
b. How many ways can they arrange themselves around a round table if a certain pair of
people cannot sit adjacent to one another?
4. Verify:
5. If the a row of Pascalโ€™s Triangle is โ€œ1, 5, 10, 10, 5, 1โ€ what is the next row?
6. Find s7 in the recurrence relation:
sn = (snโˆ’1)(snโˆ’3) โˆ’ (snโˆ’2) when s0 = 0, s1 = 1 and s2 = (โˆ’1)
7. Use the Method of Iteration to find a general solution to the recurrence relation:
sn = 3snโˆ’1 + 2, when s0 = 5.
8. Find the general solution to the recurrence relation whose characteristic polynomial
has roots 3,3,3,(โˆ’4),(โˆ’4),(โˆ’4),5,5,5,(โˆ’6),(โˆ’6),(โˆ’6),7,7,7 .
9. Find the general solution to the 2nd order, linear, homogeneous recurrence relation
with constant coefficients: sn = 2snโˆ’1 + 63snโˆ’2.
10. Find the particular solution to the recurrence relation whose general solution is
sn = A4n + B(โˆ’3)n, when s0 = 5 and s1 = 34.
n
k
โŽโŽ 
โŽ›โŽž n1โ€“
k1โ€“
โŽโŽ 
โŽ›โŽž
n1โ€“
k
โŽโŽ 
โŽ›โŽž
+=
Docsity.com

Partial preview of the text

Download Discrete Structures Exam 3 - Fall 2000 and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

CMSC 203 - Discrete Structures - Fall 2000 - Exam 3

  1. Suppose I have a collection of 27 Math books, 18 Chemistry books, 22 Biology books, and 25 Geology books. a. How many ways can I arrange all these books on a shelf if all the books are distinct? b. How many ways can I arrange all these books on a shelf if all the books are distinct and I want the books of each category to be grouped together? c. How many ways can I select 10 books if all the books of each type are the same? d. How many ways can I select 10 books if all the books of each type are the same and I want at least 2 of each type?
  2. How many orderings are there of the letters of the words: a. CHEMISTRY b. MATHEMATICS
  3. Suppose 15 people go to eat at a restaurant. a. How many ways can they arrange themselves around a round table? b. How many ways can they arrange themselves around a round table if a certain pair of people cannot sit adjacent to one another?
  4. Verify:
  5. If the a row of Pascalโ€™s Triangle is โ€œ1, 5, 10, 10, 5, 1โ€ what is the next row?
  6. Find s 7 in the recurrence relation:

s (^) n = ( s (^) n โˆ’ 1 )( sn โˆ’ 3 ) โˆ’ ( s (^) n โˆ’ 2 ) when s 0 = 0, s 1 = 1 and s 2 = (โˆ’1)

  1. Use the Method of Iteration to find a general solution to the recurrence relation: s (^) n = 3 s (^) n โˆ’ 1 + 2, when s 0 = 5.
  2. Find the general solution to the recurrence relation whose characteristic polynomial has roots 3,3,3,(โˆ’4),(โˆ’4),(โˆ’4),5,5,5,(โˆ’6),(โˆ’6),(โˆ’6),7,7,.
  3. Find the general solution to the 2nd order, linear, homogeneous recurrence relation with constant coefficients: s (^) n = 2 s (^) n โˆ’ 1 + 63 s (^) n โˆ’ 2.
  4. Find the particular solution to the recurrence relation whose general solution is

s (^) n = A4 n^ + B(โˆ’3) n , when s 0 = 5 and s 1 = 34.

n

โŽ โŽ  k

โŽ› โŽž n^ โ€“^1

โŽ k โ€“ 1 โŽ 

โŽ› โŽž n^ โ€“^1

โŽ k โŽ 

= +โŽ›^ โŽž

Docsity.com