Introduction to algorithms and data structures

Fall 2001

Schedule

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

!!!!If you download weekplan before that time, it can be updated!!!

Uge Date Text Subject Weekplan Teacher

1 29/8 CLR Chap. 1, 2, 11.1 and 11.2 Introduction week 1 SA

2 5/9 CLR Chap. 7 and 9.1 Heapsort and Priority queues week 2 SA

3 12/9 CLR Chap. 1.3, 8.1-3, 9.2-3, pages 196-199, 12.1-12.3.2 Sorting and hashing week 3 TR

4 19/9 Note [ps , pdf ], CLR Chap. 5.3-5.5 and 13.1-13.2 Recursion, induction and binary trees week 4 TR

5 26/9 Week Assigment 1 week 5 NN

6 3/10 CLR Chap. 16.1-16.3 Dynamic programming week 6 SA

7 10/10 CLR 18.1-2 and 22.1-3 Amortised analyse and union-find week 7 SA

17/10 Fall Holidays NN

8 24/10 Chap. 13.1, 13.2, 13.3, 14 + note [ps ,pdf] Balanced Search trees week 8 TR

9 31/10 Week Assigment 2 week 9 NN

10 7/11 CLR chap. 5.4, 23.1, 23.2, 23.3, and 23.4. Graph algorithms I week 10 TR

11 14/11 CLR chap. 24, 25.1 and 25.2. Graph algorithms II week 11 TR

12 21/11 Summarizing, evaluation, etc. week 12 SA

Uge	Date	Text	Subject	Weekplan	Teacher
1	29/8	CLR Chap. 1, 2, 11.1 and 11.2	Introduction	week 1	SA
2	5/9	CLR Chap. 7 and 9.1	Heapsort and Priority queues	week 2	SA
3	12/9	CLR Chap. 1.3, 8.1-3, 9.2-3, pages 196-199, 12.1-12.3.2	Sorting and hashing	week 3	TR
4	19/9	Note [ps , pdf ], CLR Chap. 5.3-5.5 and 13.1-13.2	Recursion, induction and binary trees	week 4	TR
5	26/9		Week Assigment 1	week 5	NN
6	3/10	CLR Chap. 16.1-16.3	Dynamic programming	week 6	SA
7	10/10	CLR 18.1-2 and 22.1-3	Amortised analyse and union-find	week 7	SA
	17/10		Fall Holidays		NN
8	24/10	Chap. 13.1, 13.2, 13.3, 14 + note [ps ,pdf]	Balanced Search trees	week 8	TR
9	31/10		Week Assigment 2	week 9	NN
10	7/11	CLR chap. 5.4, 23.1, 23.2, 23.3, and 23.4.	Graph algorithms I	week 10	TR
11	14/11	CLR chap. 24, 25.1 and 25.2.	Graph algorithms II	week 11	TR
12	21/11		Summarizing, evaluation, etc.	week 12	SA

CLR: "Cormen, Leiserson, and Rivest: Introduction to Algorithms".

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 Monday 13.00 of the week x+2, e.g. mandatory assigment from week 2 in heaps and sorting must be handed in by Monday 13.00 of week 4. There will be two exception from this princip, see weekplan 4 and 8.

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 ut is assumed, that all participants have studied the relevant chapters and tried to solve the assignments.

9.15-12.00 Tutorials

12.59-15.00 Lecture

15.00-17.00 Exercises