This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: p q r s t COMP2781, COMP8781, Sem. 1, 2011, Flinders University Homework Set 5 Due date: 4pm, May 27, 2011 36 marks (the same 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. Question 1 : Set 7.4, Ex. 5 ( 2 marks ) Question 2 : Set 7.4: Ex. 20 ( 4 marks ) ( N.B. Do not forget to prove formally that your functions are indeed one-to-one but not onto. Guess- ing will not attract any marks.) Question 3 : Set 11.3: Ex. 5 ( 5 marks ) Question 4 : ( 4 marks ) Show how merge sort algorithm (discussed in lectures) sorts the sequence 2 , 3 , 7 , 2 , 8 , 9 , 7 , 5 , 4 . How many comparisons are needed? How could this number be estimated using the closed form solutionmany comparisons are needed?...
View Full Document
- Spring '08