Informatics IIb: Algorithms and Data Structures
| Lecturer: | Michael Böhlen |
| Assistant: | Katerina Papaioannou |
| Teaching language: | German (English lecture notes, exercises, exam, and text book) |
| Term: | Spring 2014 |
Objectives: The course provides an in-depth understanding οf algorithms and data structures for the development of software. The programming language C is used for the implementation. The course covers the following topics: analysis and complexity, searching, sorting, lists, trees, hashing, dynamic programming, graphs, and NP-completeness.
Textbook: The textbook of the course is Introduction to Algorithms, Third Edition, Thomas H. Cormen, Charles E. Leirerson, Ronald L. Rivest and Clifford Stein, MIT Press and McGraw-Hill, 2009. The book is available at the IfI library and online from inside the UZH network. For the exercises that include C programming you can use The C programming language, Second Edition, Brian W. Kernighan and Dennis M. Ritchie.
Lectures: The lectures take place every THU 12:15-15:45 in room BIN 0.K.02.
Course Material and Announcements: The material (exercises, lecture notes) for this course will be uploaded to the OLAT website. There you also find all announcements as we progress through the semester.
Office hours: They are settled via prior email arrangement with
the assistant of the course. Before you proceed in such an arrangement,
if additional support is needed, you can try the following, in the given
order: (a) post your questions in the forum,
(b) contact your tutor
(c) contact Michael Schneider,
the teaching assistant of the course.
Exercises: During the semester, six (6) biweekly exercises will be handed out and discussed in seven (7) labs. You must hand in five (5) out of six (6) exercises and attend at least six (6) out of seven (7) labs.
Labs: The labs take place every Tuesday and Wednesday in slots specified in the following table. They involve presenting and discussing the exercises.
| Day | Time | Room 0.B.04 | Room 0.B.06 |
| Tuesday | 16:15 - 17:45 | Christian Tschanz | - |
| 18:15 - 19:45 | Christian Tschanz | Patrick Hodel | |
| Wednesday | 16:15 - 17:45 | Osman Jakupi | Daniel Abächerli |
| 18:15 - 19:45 | Osman Jakupi | Daniel Abächerli |
Evaluation: In order to pass the course, you must successfully complete three parts:
- attend at least six labs and hand in at least five exercises
- two midterm exams (Zwischentests)
- the final exam.
A midterm test is passed if about 50% of your answers are correct. For an exercise you must make a clear effort to solve half of the exercise.
If you fail or cannot attend (due to a justifiable cause, e.g., illness, military service) one or both midterms, you should do the repetition exam (Nachholtest).
| Midterm 1 | Friday, 28.03.2014, 10:00 -14:00 | AlgoDat: BIN 0.B.04/BIN 0.B.06 Modellierung: BIN 0.K.02 |
| Midterm 2 | Friday, 09.05.2014, 10:00 -14:00 | AlgoDat: BIN 0.B.04/BIN 0.B.06 Modellierung: BIN 0.K.02 |
| Repetition Exam | Friday, 16.05.2014, 14:00 -16:00 | AlgoDat: BIN 0.B.04/BIN 0.B.06 Modellierung: BIN 2.A.1 |
| Final Exam | Wednesday, 28.05.2014, 10:00 -12:00 | AlgoDat: BIN 0.B.04/BIN 0.B.06 Modellierung: BIN 2.A.1 |
Auxilliary material in the exams: At each exam for Informatics IIb (Midterms, Repetition Exam, Final Exam) you are allowed to use one A4 sheet with your personal notes (both sides, hand written).
Absences: In case of a justifiable absence in a lab or midterm, please provide proof of your absence (e.g. document signed by the doctor, military supervisor) to Katerina Papaioannou as soon as possible.
Final Grade: Your final grade will be equal to the grade of your final exam if you enrolled in Informatics IIb only. In case you are enrolled in Informatics II your grade will be the weighted average (1/3 for Informatics IIa, 2/3 for Informatics IIb).
Here you find additional relevant information about the Informatik II course.