[ Home ] [ Slides ] [ Examples ] [ Exercises ] [ Resources ]

Algorithms and Data Structures

Dr. Emmanuel Benoist,
mail: emmanuel(at)benoist.ch

Goals of this course

The students can create compute the complexity of a rather complicated algorithm. They have understood the flat data structures like arrays and linked lists. They know and can use trees (general or binary). A student can modelize a problem using a graph and use one of the well know algorithms to solve it. They also know some standard technics used in algorithm design.

Schedule

Class Day Time Room
I1a Monday 8:00 - 9:35 401
Wednesday 09:50 - 11:25 401
Friday 09:50 - 11:25 401
I1b Monday 8:00 - 9:35 401
Wednesday 09:50 - 11:25 401
Thursday 11:40 - 13:15 401
I1c Monday 8:00 - 9:35 401
Wednesday 09:50 - 11:25 401
Thursday 09:50 - 11:25 401

Software Requirements

All exercises in this course have to be implemented in Java. The version used for the examples is Java 1.5.
Copyright Emmanuel Benoist 2006