{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Homework Set 04 - Set 5.7 Ex 11 25 Set 5.8 Ex 14 Question 9...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
p q r s t COMP2781, COMP8781, Sem. 1, 2011, Flinders University Homework Set 4 Due date: 4pm, May 13, 2011 33 marks (39 for COMP8781) Please hand in the solutions to the topic assignment box - located on the second floor of the IST building, opposite the School Office. Ensure your paper is clearly signed and includes FAN. As stated in SAM late submissions will not be accepted unless arranged with the topic coordinator. N.B. To attract marks your solution must be original, clear and carefully explained. Each question is worth up to 3 marks unless stated otherwise. Set 5.2, Ex. 14, Set 5.3: Ex. 20, 25 Set 5.4: Ex. 7 Set 5.5: Ex. 11 ( 4 marks
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 n-bit 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 n-element 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

{[ snackBarMessage ]}