Study Guide

Objective

- you know how to analyse asymptotic time complexity of algorithms, including recursive algorithms. You are able to measure and extrapolate running real time of programs.
- you understand basic concepts of graphs, graph properties and graphs as abstract data types.
- you understand elementary graph algorithms and you are able to design, implement, and analyse simple graph algorithms.
- you know elementary algorithm strategies and you are able to apply those.
- you know how to use mass storage efficiently and you are able to analyse running time of algorithms using mass storage.

Content

- Algorithms and running time analysis.
- Experimental time complexity analysis.
- Graphs, graph algorithms, and applying graph algorithms.
- Using mass storage efficiently.

Evaluation scale

H-5

Further information

Prerequisites : Data Structures and Algorithms I, or similar skills.