Design and Analysis of Algorithms

Discrete Mathematics, Data Structures

After completing the course students understand the design principles of algorithms and can apply them. Students can analyse the effectiveness of a given algorithm and can create a recursive formula and solve it using different methods and can apply amortized requirement analysis methods. On completion of the course, students are familiar with different types of algorithms, the methods for solving them and effectiveness. Stu-dents know the most important design principles of algorithms together with the most central effective algorithms. The course develops critical and analytical thinking as well as problem-solving skills. Students also have the capacity to follow research on algorithms.

E-book Introduction to algorithms (Cormen, Leiserson, Rivest & Stein) and other material as assigned during the lectures.

Responsible organisation: School of Technology and Innovations