
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This exam paper is very easy to understand and very helpful to built a concept about the foundation of computers and discrete structures.The key points in these exam are:Characteristic Polynomial, Iterative Method, Particular Solution, Recurrence Relation, Polynomial Roots, Algorithm with Complexity, Bijective Function, Inverse of Function, Directed Graphs, Composition of Function
Typology: Exams
1 / 1
This page cannot be seen from the preview
Don't miss anything!

1. How many distinct words can I create from the letters of the words: a. ORANGE b. PINEAPPLE 2. How many distinct ways can I arrange the letters of the word AROUND in a circle? 3. How many ways can a state issue 7-character license plate if the characters are one of 26 letters or 10 digits, and the state wants: a. the characters to alternate letter, digit, letter, digit, etc., with the first character a letter? b. the second character to be a letter and the last three to be digits? 4. Given the alphabet { w,x,y,z }, how many 12-long strings have 1 w , 2 x ’s, and 3 y ’s? 5. How many ways can I arrange 10 Math, 15 Computer, and 20 Chemistry books on a shelf... a. ...if all the books of the same type must be grouped together? b. ...if I all the books of the same type must be grouped together and the Math books must be in the middle? 6. The ACME Candy company makes 33 different varieties of candy. How many ways can they create gift boxes containing 16 pieces of candy? 7. Use the iterative method to find the particular solution of the recurrence relation: s (^) n = 2s (^) n-1 + 5 with s 0 = 1 8. Find the characteristic polynomial to the recurrence relation: a. sn = 3s (^) n-1 − 8s (^) n-2 b. s (^) n = 3s (^) n-2 − 8s (^) n- 9. Find the general solution to the recurrence relation a. sn = −2s (^) n-1 + 35s (^) n-2 b. with characteristic polynomial roots: 3,3,3,4,4,4, 10. Find the particular solution to the recurrence relation whose general solution is:
s (^) n = A(−4) n^ + B3n, subject to s 0 = 7 and s 1 = 9.