home search a-z help
University of Cambridge Computer Laboratory
Data Structures and Algorithms
Computer Laboratory > Course material 2006-07 > Data Structures and Algorithms

Data Structures and Algorithms
2006-07

Principal lecturer: Dr Frank Stajano
Taken by: Part II (General), Diploma

Syllabus
Past exam questions

Feedback
Anonymous user feedback was collected halfway through the course on paper forms. All participants are warmly encouraged to submit further anonymous feedback at the end of the course, noting good points that they think should be preserved and bad points that they think should change. A summary of feedback so far received is available (from .cam.ac.uk).

Microchallenges (requires Raven authentication)

Hall of fame

My smartest students for this course

Taking up the microchallenges is always a smart move. Whether you win or not, the journey is the reward.

DateNameClaim to fame
2006-10-09Microchallenge 1: Boolean logic
Robert HoffParticipant
Iain ParrisParticipant
Edward DrakeWinner
jk350Participant
David ProctorParticipant
Carl ForsellParticipant
Mark BattyParticipant
Tim BellisParticipant
sasParticipant
cvr25Participant
xl259Participant
LangJie DengParticipant
Hemant Kumar ChoudharyParticipant
2006-10-16Microchallenge 2: Hanoi
Robert HoffParticipant
Joe KearneyParticipant
Tim BellisWinner
Richard MooreParticipant
Xin LiParticipant
Chris RobertsParticipant
sasParticipant
Langjie DengParticipant
2006-10-23Microchallenge 3: Mergesort
sasParticipant
Robert HoffParticipant
Xin LiParticipant
2006-10-23Microchallenge 4: Quicksort
Robert HoffParticipant
ram52Participant
Xin LiWinner
sasParticipant
2006-10-30Microchallenge 5: Priority Queue
Tim BellisWinner
Robert HoffParticipant
Xin LiParticipant
Carl ForsellParticipant
Langjie DengParticipant
Anna BineyParticipant
2006-11-06Microchallenge 6: Building a 2-3-4 Tree
Ed DrakeParticipant
Anna BineyWinner
Xin LiParticipant
Joe KearneyParticipant
Robert HoffParticipant
Olga SkripnikovaParticipant

FAQ: Can I please see the text of past microchallenges?

Answer: No. I already explained why during the lecture of 2006-10-20, so I assume you didn't come to that either. Pity.

Microchallenges are optional. I hold in high esteem those who attempt them because they do so as we progress through the syllabus. Microchallenges are not provided as random programming exercises: they are instead an incentive to work on (and understand) the topics of the course as we go along. For this reason they are a privilege reserved to those smart ones who take the challenge while it's open. Timing is everything. Use it or lose it. This is true in general.

It is a misunderstanding of the spirit in which microchallenges are offered to want to solve one past its Best-Before date. Instead of that, I recommend writing another program about the bits of the course that seem most difficult. Even better would be to attempt the next available microchallenge.

Having said that, if any latecomers are still keen to catch up on expired microchallenges, they could always ask for the assistance of the people listed on the hall of fame, who were smart enough to take the microchallenge when it made sense: the hall-of-famers might still have a copy of the text and might be willing to share it and discuss it. Such serendipitous cooperation might yield unexpected benefits, whether technical or social.