Syllabus academic year 2007/2008

Higher education credits: 6. Grading scale: TH. Level: A (Second level). Language of instruction: The course will be given in English. Optional for: D4, D4ps, E4ps, F4, F4tvb, L4, Pi3sbs. Course coordinator: Rolf Karlsson,, Inst f datavetenskap. Prerequisites: EDA027 Algorithms and Data Structures, FMA410 Calculus in One Variable and FMA420/425 Linear Algebra. Assessment: The final grade is based on a written examination and on 5 assignments. Home page:

To give a deeper knowledge of the design and analysis of efficient algorithms and give training in algorithmic problem solving

Knowledge and understanding
For a passing grade the student must

Skills and abilities
For a passing grade the student must

Methods for solving recurrences. Order statistics. Red-black trees. Augmenting data structures. Dynamic programming. Greedy algorithms. Shortest paths. Computational geometry. Maximum flow. Sorting networks. String matching.

Cormen T, Leiserson C, Rivest R & Stein C: Introduction to Algorithms. Second Ed. McGraw-Hill & MIT Press 2001. ISBN: 0-262-53196-8