Aims

To give basic knowledge about fundamental algorithms and data structures and the implementation aspects of these. To give capabilities to choose algorithms and data structures given a specific problem, and to give fundamental knowledge in C programming.

Content

Programming in C. Mathematical foundations: asymptotic notation, summations, reccurence equations. Data structures: trees, priority queues, tables. Searching: Binary search trees, balanced search trees, hash tables. Sorting. Simple graph algorithms and greedy algorithms.

Instruction

Lectures, laboratory work and compulsory assignments.

Assessment

Written exam at the end of the course. Mandatory assignments form an important part of the examination.