Lektionsplanen vil løbende blive opdateret i løbet af semesteret. Der må derfor tages højde for ændringer.

 

Uge	Dato	Tekst	Emne	Ugeseddel	Forelæser
1	7/2		Introduktion + Time-space tradeoffs for sorting	uge 1	TR
2	14/2		Grundlæggende lineære teknikker til streng og mønstergenkendelse	uge 2	SA
3	21/2		Signatur-indkodning af strenge	uge 3	TR
4	28/2		NP	uge 4	PB
5	7/3		Randomiserede Algoritmer I : introduktion	uge 5	TR
6	14/3		Randomiseret Algoritmer II : Grafalgoritmik	uge 6	SA
7	21/3		BIO-Algoritmik	uge 7	CS
	28/3		Påskeferie
8	4/4		Randomiserede algoritmer III	uge 8	SA
9	11/4		Randomiserede algoritmer III (fortsat)	uge 9	SA
10	18/4		Approksimationsalgoritmer	uge 10	TR
11	25/4		I/O-algoritmik	uge 11	NN
12	2/5			uge 12	NN

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 at 13.00 of the week x+2.

Lectures and tutorials take place between 9.15 and 17.00. The day is divided as decribed in the table below. At the tutorials it 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