Entry requirements

10 credits in computer programming (Program Design, Programming Techniques II, or the equivalent) and 10 credits in mathematics, including basic algebra. Alternatively 45 credits in the Master's Programme in Language Technology (HSP2M).

Learning outcomes

On completion of the course, the student should be able to:

• analyse the runtime performance of algorithms/programs in terms of the size of its inputs, and this in the average, best, and worst cases.
• choose appropriate algorithms and data structures for storing data, searching and sorting, as well as implement those algorithms.
• use and implement basic graph algorithms.
• use asymptotic notation for reasoning about time and space complexity of algorithms and data structures.
• reason on a basic level about the correctness of algorithms.
• suggest simple algorithms with appropriate complexity for new well-defined problems.

Content

Mathematical foundations: asymptotic notation, summations, recurrence relations, and induction.

Data structures: trees, FIFO queues, stacks, linked lists, priority queues, heaps, binary search trees, and hash tables.

Sorting: insertion sort, merge sort, quick sort, and heap sort.

Graph algorithms: depth first and breadth first search, topological sort, and strongly connected components.

Design techniques: divide-and-conquer.

Implementation of algorithms and data structures.

Instruction

Lectures, tutorials, and assignments.

Assessment

Written exam (4 credits). Assignments (1 credit).

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.

Other regulations

The unit cannot be included in a degree with Program Design II (1IT022), nor with Data Structures (1DL009, 1TD191, 1MB026).