The course takes place in quartile b of semester 1, that is from the 11th till the 18th week of the academic year. Main objective of the course is learning how to solve problems in electrical engineering with efficient combinatorial algorithms. Starting point of most session is an electrical engineering problem, which is introduced and then abstractly formulated. A connection with chapters of the book is made and shown to contain an adequate answer. The solution is applied to the engineering problem, generalized and analyzed with respect to complexity.
Course material: the book for both 5MC10 and 5MD20 is
J.Kleinberg and E.Tardos, Algorithm Design Addison Wesley 2006.
For 5MC10 the material is in the first nine chapters!
Alternative material is:
T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press 1990.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms, 2nd edition. MIT Press 2001.
Theory can be found in the chapters
1, 2, 4 , 7.5, 11, 12, 13 ,16, 17, 22, 23, 24, 25, 26, 27, 32, 34, 36, 37
(edition 1990, excluded are the sections with an asterisk).
For the 2001 editie: 1-4, 6.5, 10-12, 15,16, 21-26, 30, 32, 34, 35.
Exams are in written form and the book can be used (open book) combined with a task. During the exam an algorithm is to be developed and analyzed and possibly simplified, for attacking a problem in electrical engineering. In the next three weeks this algorithm is to be implemented and demonstrated to the teacher.
Lecture slides (available during the course) and other material: sheets