Algoritmen en Datastructuren


This course is about the design and analysis of algorithms: how to design correct and efficient algorithms. The main goal of this course is to provide the intellectual tools for designing and analyzing your own algorithms for problems you need to solve in the future. Some design tools that we will discuss are: data structures (e.g. hash tables, AVL trees, red-black trees), divide-and-conquer, dynamic programming, greedy algorithms, network flows, and linear programming. A significant part of the course will be devoted to a discussion of various graph algorithms.


To provide the intellectual tools for designing and analyzing algorithms.


List of topics includes: 
- models of computation;
- basic O-notation to analyze algorithms;
- divide and conquer;
- greedy algorithms;
- data structures: heaps, AVL trees, red-black trees, ...;
- graph algorithms;
- dynamic programming;
- linear programming;


  • 32 uur hoorcollege
  • 32 uur werkcollege
  • 104 uur zelfstudie

Toelichting werkvormen

There will be lectures, problem sessions with pen-paper exercises and a practical assignment. 


0.6 * T  + 0.4 * P, where T is the result of the test and P the result of the practical assignment. 

Vereiste voorkennis

Basic programming experience and basic math knowledge (induction, sets, logic, proofs).


Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Introduction to Algorithms

A standard monograph on algorithms, including their complexity.

6 ec
eerste semester


Opgenomen in

  • Bachelor Informatica