The course starts on 31 August in MA6, and has 14 lectures and 6 tutorials.
|w 35||w 36||w 37||w 38||w 39||w 40||w 41|
|Tue 13-15 (E1406*)||lec 1||lec 3||lec 5||lec 7||lec 9||lec 11||lec 13|
|Thu 10-12 (MA1)||lec 2||lec 4||lec 6||lec 8||lec 10||lec 12||lec 14|
|Thu 13-15 (E3319)||tut 1||tut 2||tut 3||tut 4||tut 5||tut 6|
|Fri 8-10 (E1405)||tut 1||tut 2||tut 3||tut 4||tut 5||tut 6|
Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms. Third Edition. MIT Press 2009. ISBN 0-262-53305-8. If you have the first or second edition of the book, ask the teacher for a supplementary page.
Designing algorithms is an elegant and important skill of great practical significance. Powerful computers do not reduce the need for faster algorithms. In most applications it is not the hardware but inefficient software that is the bottleneck.
"Algorithmics is more than a branch of computer science. It is the core of computer science, and, in all fairness, can be said to be relevant to most of science, business, and technology" [David Harel, Algorithmics: The spirit of computing].
The Algorithm: Idiom of Modern Science [B. Chazelle].
The course addresses central questions that occur when one wants a computer to do anything, for instance: Is it practically possible? How do we do it? How fast can it be done? The course provides knowledge and methods to answer such questions and aims at increasing the ability to design efficient algorithms. Five assignments give training in algorithmic problem solving and stimulate to active learning during the course.
EDAA01/EDA027 and FMA420 + recommended: FMA410.
Fredrik Andersson, dt07fa5 (at) student.lth.se
Robin Karlsson, pi07rk3 (at) student.lth.se