Lehre » Sommer 22 » Algorithms and Data Structures

Bridge Course Algorithms and Data Structures (SS 22)

A blended learning bridge course for master students with little background in theoretical computer science.
This course is only open for students of the following Master programs: (Students from other programs may of course watch the video lectures and study the text book on their own. However, they can neither register for the exam, nor take the exam, and in particular they cannot receive credit points for this course.)

Registration Process

It is not necessary to register for the lecture, because this course is a self learning course.


At the end of the term, there will be an oraln exam of 30 minutes. Although that the time will maybe not suffice to cover every topic in an oral exam, make sure to learn all the topics from the course to prepeare for the exam. The exams will take place at the beginning of September. You will be able to choose your time slot. More information on this, will be provided later.

Recommended exercises

On top of the [problems and exercises] posed at the MIT page, we also recommend the following exercises and problems from the book by Cormen et al (2nd edition). Exercises are shown in black, and problems (listed in the final section of every chapter) are shown in red color.


The course is self paced and consists of 12 [video lectures] from MIT Open CourseWare.
The [course material] has been developed by Prof Charles Leiserson and Prof Erik Demaine.


The underlying text book is "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald Rivest, and Clifford Stein, MIT Press.
All references to chapters (and in particular: all numbers of exercises and problems) concern the 2nd edition of the book; the other editions contain essentially the same information, but slightly deviate in the numbering of chapters and exercises.