Introduction to algorithms and data structures

Spring 2002


Schedule


We plan to have the weekplan for the following week (week x+1) ready by Tuesday morning (week x).

!!!!If you download weekplan before that time, it can be updated later!!!
 
Uge Date Text Subject Weekplan Teacher
1 4/2 CLRS Chap. 1, 2, 3, 10.1 and 10.2 Introduction  week 1  SA 
2 11/2 CLRS Chap. 6 and 8.1 Heapsort and Priority queues  week 2   SA 
3 18/2 CLRS Chap. 2.3, 7.1-3, 8.2-3, pages 196-199, 11.1-11.3.2 Sorting and hashing   week 3   TR 
4 25/2   Week Assigment 1 week 4 NN
5 4/3 Note [ps, pdf], CLRS appendix B.3-B.5 and 12.1-12.2 Recursion, induction and binary trees week 5  TR
6 11/3 CLRS Chap. 15.2-15.4 Dynamic programming week 6 SA
7 18/3 CLRS 17.1-2 and 21.1-3 Amortised analyse and union-find week 7 SA
8 25/3 CLRS Chap. 12.1, 12.2, 12.3, 13 + note [ps ,pdf] Balanced Search trees week 8 TR
  1/4   Fall Holidays   NN
9 8/4 CLRS Appendix B.4, Chap., 22.1, 22.2, 22.3, and 22.4. Graph algorithms I week 9 TR
10 15/4 CLRS chap. 23, 24 Graph algorithms II week 10 TR
11 22/4   Week Assigment 2 week 11 NN
12 29/4   Summarizing, evaluation, etc. week 12 SA

CLRS: "Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms, Second Edition".

The weekplan describes the subject, text, and assignments of the week. An assignment can be marked with either an H, an S, or an O. An H indicates that the assignment can hopefully be solved by everyone at home, and we will not spend time on these assignment at the course. An O indicates that the assignment is mandatory, and an S indicates that the assigment is difficult. Mandatory assignments of week x must be handed in no later than Thursday 13.00 of the week x+1, e.g. mandatory assigment from week 2 in heaps and sorting must be handed in by Thursday 13.00 of week 3. There will be two exception from this princip, see weekplan 3 and 10. To some of the weeks there will be an alternartive mandatory assigment, which you can solve in stead of the exercises marked with O.

Lectures and tutorials take place between 9.15 and 17.00. The day is divided as decribed in the table below. From 9.15-12.00 teaching assistants work with last weeks assignments in tutorials. At the tutorials it is assumed, that all participants have studied the relevant chapters and tried to solve the assignments. To the first lecture we will might change the day schedule.
 
 
9.15-12.00 Tutorials
12.59-15.00 Lecture
15.00-17.00 Exercises