News
|
30.10.2020
|
Re-examThe points for the re-exam can now be found on this website after logging in. If you want a (virtual) exam inspection, contact Karl Bringmann until November 3. |
|
12.10.2020
|
Grading SchemeThe grading scheme can be found (after logging in) under Information -> Grading. |
|
06.10.2020
|
Final ExamDear participants, Note that the final exam of Algorithms and Data Structures will happen on Thursday. There is also an exam inspection on Monday. Endterm: October 8, 2020, 14:00-17:00, HS 002 E13, exam inspection: October 12, 14.30 - 16.00, HS 001 E13 Dear participants, Note that the final exam of Algorithms and Data Structures will happen on Thursday. There is also an exam inspection on Monday. Endterm: October 8, 2020, 14:00-17:00, HS 002 E13, exam inspection: October 12, 14.30 - 16.00, HS 001 E13 The material of the whole course is relevant for the final and re-exam, but the focus is on the second half. You are allowed to bring a cheat sheet: A4 format, handwritten, two-sided; you can take it with you after the exam. Bring your student ID for checking. Please note that it is absolutely necessary for you to bring your own protection mask with you. Students who have a doctor’s certificate that they cannot wear protection masks have to bring their own face shields and wear these instead of a mask. If your answer is "yes" to one or more of the following questions, then you are not allowed to attend the exam. If you provide a doctor’s certificate to the examination office later on, the examination attempt will be canceled and will not count. All participants and supervisors have to wear protection masks when they enter/leave the room, when talking to each other, and when checking student identities. Due to the safety of all persons in the room it is strongly recommended to wear protection masks during the entire exam. Good luck, |
Algorithms and Data Structures (block course)
The course will cover basic and advanced data structures and algorithms and their analysis. Examples of data structures are cuckoo hashing, splay trees, randomized search trees, union-find structures. In terms of algorithms, we first focus on graph problems, in particular network flows, and matchings, and later on geometric problems and on approximation algorithms.
Time & Date & Format
This core course will be offered in an intensive block version between February 26 and March 27.
The format of the course will be as follows: A "unit" consists of a 60+Epsilon minute lecture, followed by 2 hours of group work on an exercise sheet, followed by a short discussion section with a tutor. Typically we will have two units a day, the first starting at 9am, the second at 2pm, Monday through Friday, except for all Wednesdays in March, which will have only the morning unit.
This will be a very intensive course. Do not plan on doing anything else serious beside it.
Grading
Your final grade will be determined by your performance on a midterm exam (35%) and a final exam (65%). There will be a repeat exam for the final. Admittance to the exams requires active participation in the course.
Exams
Midterm: March 12, 2020, 14:30-16:30
Endterm: October 8, 2020, 14:00-17:00, HS 002 E13, exam inspection: October 12, 14.30 - 16.00, HS 001 E13
Reexam: October 23, 2020, 14:00-17:00, HS 002 E13