Data Structures

Sem 1, 2009-10

Lecture Slides


  1. Lists and Sets. Due Date: Sunday, Sep. 6, 11:59pm.
  2. Hashing. Due Date: Sunday, Sep. 13, 11:59pm.
  3. Binary search trees. Due Date: Sunday, Oct. 11, 11:59pm.

Programming Projects

  1. Towers of Hanoi. Due Date: Sunday, Sep. 20, 11:59pm.
  2. DNS Cache. Due Date: Sunday, Oct. 19, 11:59pm.
  3. Discrete Event Simulator. Due Date: Tuesday, Nov. 24, 11:59pm (hard deadline, no extensions).
  4. Shortest Paths. Due Date: Tuesday, Dec. 8, 11:59pm (no extensions possible).


Academic Integrity Code

Academic honesty is required in all your work. Verbal discussion of assignments is fine but looking at someone else's work and then doing your is not. You must do all written and programming assignments on your own, except where group work is explicitly authorised. Letting your work become available or visible to others is also cheating. First instance of cheating will invite a zero in the assignment and a letter grade penalty. Repeat offender will fail the course.