Exercises for Efficient Algorithms and Data Structures I

Announcements:

• You can find question papers of some old exams below the Assignment Sheets.

General Information:

• Teaching Assistant:
  Chintan Shah
• Place and Time:
  Tuesday,14:15–15:45, MI 00.08.038 (Chintan Shah) or
  Wednesday,10:15–11:45, MI 03.11.018 (Yutaka Nagashima) or
  Thursday,12:30–14:00, MI 01.07.014 (Sudeep Kanav) or
  Friday,12:15–13:45, MI 00.13.009A (Chintan Shah)
  
• Office Hours:
  Wednesday, 11:30-12:30
  
• Submission of Solutions to Exercises:
  Exercises are posted on this webpage on Wednesdays.
  Solutions should be submitted in English by 10:10 on Thursday of the following week, by leaving them in the appropriate folder in Room No. MI 03.09.051. There is a folder corresponding to each tutorial session. Solutions can be submitted in groups of upto 3 persons. On each submission, you should also write the day of the session where you would collect the corrected solutions. Each student in a group gets the same marks for the corresponding assignment. Every student needs to obtain an average of 40% marks for all assignments, from the 2nd assignment onwards.
  The corrected/assessed solutions can be collected the following week in the tutorial session corresponding to the folder where the solution is placed, or later from Room No. 03.09.051.

Exercises and Solutions

• Exercise 1 – Solution 1
• Exercise 2 – Solution 2
• Exercise 3 – Solution 3
• Exercise 4 – Solution 4
• Exercise 5 – Solution 5
• Exercise 6 – Solution 6
• Exercise 7 – Solution 7 There was a mistake in Q1(b). So, the marks will be counted from a maximum of 26.
• Exercise 8 – Solution 8
• Exercise 9 – Solution 9
• Exercise 10 – Solution 10
• Exercise 11 – Solution 11
• End Term Examination for WS 2011-12
• Repeat Examination for WS 2011-12
• Examination for WS 2012-13 There are some hard copies in the Tuesday Assignment Folder in Room No. 03.09.051. Feel free to collect one.

Other

• Theoretical Computer Science Cheat Sheet