Lectures Introduction to Theory of Computation Discrete Probability Theory Fundamentals of Algorithms and Data Structures Efficient Algorithms and
Data Structures II Online and Approximation Algorithms Complexity Theory Proseminar Graph Drawing Seminar / Master Seminar Approximation Algorithms Energy-efficient Algorithms Lab Course Algorithms for Programming Contests Courses for PhD Students Oberseminar

Exercises for Efficient Algorithms and Data Structures II

Announcements:

• The examination paper from 2013 and the last exercise are available.

General Information:

• Teaching Assistant:
  Chintan Shah
• Tutorial - Time and Place:
  Tuesday, 14:05–15:35, MI 03.07.023
• Office Hours:
  Wednesday, 11:30-12:30
• Submission of Solutions to Exercises:
  Exercises are posted on this webpage on Mondays. You should submit solutions in English by Monday of the following week by leaving them in the folder " EADS Submissions" in Room No. MI 03.09.051 or by handing them personally to the teaching assistant. Solutions will be discussed in the following tutorial session. You can collect corrected solutions in the tutorial.

Exercises

• Exercise 1
• Exercise 2
• Exercise 3
• Exercise 4
• Exercise 5
• Exercise 6
• Exercise 7
• Exercise 8
• Exercise 9
• Exercise 10

Old Exam

• 2013 exam