Introduction to Algorithms
2005-06
Principal lecturer: Dr Frank Stajano
Taken by: Part II (General), Diploma
Syllabus
Hall of fame
My smartest students for this course
Date | Name | Claim to fame
|
---|
2005-10-07 | Jean-Baptiste Hetier | First to respond to
microchallenge 1 (only 32 mins after the end of the lecture), with an
exemplarily clear solution, though only 2/3 correct.
| 2005-10-07 | Michael Dawber | First 100% correct answer for
microchallenge 1 (but without any explanation).
| 2005-10-09 | Cecily Morrison | Meritorious pedantry and lateral
thinking about microchallenge 1.
| 2005-10-10 | James Bridge | Correctly found the number of
subsets of {1, 2, 3, 4, 5, 6, 7}
| 2005-10-12 | Jean-Baptiste Hetier | First correct
answer for microchallenge 2
| 2005-10-12 | Jean-Baptiste Hetier | First correct
answer for microchallenge 3 (at the 2nd try)
| 2005-10-12 | Kay Henning Brodersen | Correct answer for
microchallenge 2
| 2005-10-12 | James Bridge | Correct answer for
microchallenge 3
| 2005-10-13 | James Bridge | Correct answer for
microchallenge 2 (at the 2nd try, after discussion with peers)
| 2005-10-13 | Michael Dodson | Correct answer for
microchallenge 2
|
Helpful typo spotters
Date | Name | Page | Line | Errata | Corrige
|
---|
2005-10-12 | author | 17 | 13 | functions as
graphs | functions as matrices
| 2005-10-17 | author | 12 | -4 | The bit with N Z Q R C,
which I can't easily typeset in portable HTML. | All the
inclusion symbols in that chain should be the other way round.
|
Negative lines are counted from the bottom of the page.
Additional material
2005-10-07 Lecture 1
You may play with the Towers of Hanoi at Superkids
(among other places) if making them out of cardboard is not your idea
of fun. As you might expect, on the web you'll find more than you could
possibly want to know about this puzzle.
|