This lecture completes first semester teaching in programming and algorithm design. It is focused on analysis of algorithms and advanced data structures and algorithms. Practical work is used to implement concepts studied during lectures, but also possibly to practice new concepts.
Analysis of algorithms: best and worst case, average analysis and amortized cost.
3. Priority queues
Recursive programming; divide and conquer.
Algorithms and data structures 1.
Continuous assessment (CC) + one written exam (3h max, E1) and a mark for the practical work (TP).
The course exists in the following branches:
Course ID : 3MMALGO
The course is attached to the following structures:
You can find this course among all other courses.
T. Cormen, C.E Leiserson, R. Rivest, C. Stein : Introduction to algorithms, MIT Press, 3rd edition, 2009.
J. Kleinberg, E. Tardos : Algorithm design, Pearson, 2005.
Date of update January 15, 2017