Prof. Dr. Stefan Funke

This lecture takes place twice a week (on average 3 h of lecture and 1 h tutorial) in the following slots:

Exercise
* MC-Test

There will be a written exam at the end of the semester (unless your Prüfungsordnung does not allow that; in that case, there will be an oral exam). Prerequisite for participation in the exam is a ‘Schein’, i.e. you need to pass two MC-tests.

News

• The results of the fall exams are announced on the notice board at the institute!
• The exam grading scale has been adjusted in favor of the student (Passing mark was reduced to 55 points).
• Updated the exam results. Some gradings have changed by 0 to +4 points in the first section.
• The exam results are published at the institutes notice board (near room 1.101).
  The exam review will take place at april, 11th 3:30 pm (15:30) in room 1.140.
• The results of the third mc test are published at the institutes notice board (near room 1.101).
  Please all check your “Schein” status to ensure you fullfill the prerequisite to write the exam!
• The third mc test will take place at feb. 28th, 2:00 p.m. in room 0.108. You need to participate if you passed only one of the former two mc tests.
• The summary slides to the lecture are now available
• The results of the second mc test are published at the institutes notice board (near room 1.101).
• There will be an repetition course from feb. 21st to feb. 28th. Please find more information below.
• There will be no lecture/tutorial at feb. 6th
• The results of the first mc test are published at the institutes notice board (near room 1.101).

Repetition Course

The repetition course contains a lecture (held in german) to repeat basic lecture stuff. A supervised exercise session follows to deepen the topics and pose some questions.

The course will take place in the lecture hall V38.02 in the computer science building.
The course dates are as follows:

Repetition exercise sheets

not available anymore

Exercises/Tutorials

Filip Krumpe

The final dates of the tutorials are announced during lecture at least one week before the tutorial takes place. For each tutorial there will be an exercise sheet. Please take a look at the sheet before the tutorial and solve the exercises on your own.

A fake MC-test of the year 2014 can be found here.

Exercise Sheets:

not available anymore

Literature

A very good book on approximation algorithms by Shmoys and Williamson can be found online.

Lecture Notes (currently work in progress. Please report any mistakes if you find some).

Basic Concepts

should be easy to find via google, e.g.

• Graphs/Graphen
• Breadth-First-Search/Breitensuche
• Depth-First-Search/Tiefensuche

Intended Audience

Students at the master (INF, SWT, INFOTECH, Winfo, …) or advanced Bachelor level.