This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ) Set 5.7: Ex. 11, 25 Set 5.8: Ex. 14 Question 9 ( 4 marks ) Let a n be the number of nbit strings that do not contain the pattern 010 . Find a recurrence relation and initial conditions for the sequence a 1 , a 2 , a 3 , . . . . Question 10 ( 4 marks ) Find a recurrence relation (and initial conditions) for the number of subsets S n of an nelement set. Use the method of iteration to nd an explicit formula for the sequence. The following additional questions are for COMP8781 students only Each question is worth up to 3 marks. Set 5.3: Ex. 17 Set 5.8: Ex. 6 Page 1 Last updated May 2, 2011 by M. Bajger...
View
Full
Document
This note was uploaded on 06/12/2011 for the course MATH 103 taught by Professor Wouters during the Spring '08 term at Wisc Oshkosh.
 Spring '08
 WOUTERS
 Algebra

Click to edit the document details