|Assistants:||Qing Chen Muhammad Saad|
|Teaching Assistants:||Xiaozhe Yao Andrianos Michail Zifan Jiang|
|Tutors:||Christoph Vogel Adam Klebus Hsuan-Pin Wu Qasim Warraich Jérome Hadorn|
|OLAT link:||Coming soon|
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 and graphs.
Literature: 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 as a reference The C programming language, Second Edition, Brian W. Kernighan and Dennis M. Ritchie.
**** all things below will be updated soon*****
Lectures: The lectures take place every TUESDAY 14:00 - 15:45 in room HAH-E-11 (Häldeliweg 2) and FRIDAY 12:15 - 13:45 in room Y15-G-60 (Irchel).
Course Material and Announcements: The material (exercises, lecture notes) for this course will be uploaded to the OLAT Website(Link). There, you also find all announcements as we progress through the semester.
Other course websites:
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 the teaching assistant of the course.
During the semester, twelve (12) weekly exercises will be handed out and discussed in thirteen (13) labs. The exercises are not part of assessment so it will not be required to submit exercises of solution.
Every week new exercise will be published. Students will be given 1 week to solve the exercise themselves. After a week, solutions will be discussed in the labs.
Labs that are cancelled due to public holidays, are scheduled for different dates, if possible in the same week.
The labs take place every week in slots specified in the following table. Attendance in the labs is not mandatory but highly recommended.They involve presenting and discussing the exercises.
Lab 2, 23.03.2020, 16:00 - 17:45, AND-3-02/06
Lab 2, 20.04.2020, 16:00 - 17:45, AND-3-02/06
Lab 2, 11.05.2020, 16:00 - 17:45, AND-3-02/06
Lab 4, 25.03.2020, 16.15 - 17.45 , BIN-0-K.02
Every exam will be corrected and graded from 1 to 6.
The final grade will be calculated based on the grades from midterms as well as final exam as follows:
Final Grade = MAXIMUM (MidTerm 1, Final Exam) * 0.2 + MAXIMUM (MidTerm 2, Final Exam) * 0.2 + (Final Exam) * 0.6
Midterm tests: The material of the midterm exams comprises the material discussed in the lectures until the date of the exam. If anyone fails to attend the midterm exams due to any reason, he/she will be awarded 0 points.
|Midterm 1||Monday 23 March, 2020 (12.15 - 13.45)||
HAH-E-03 (Häldeliweg 2)
Monday 27 April, 2020 (12.15 - 13.45)
HAH-E-03 (Häldeliweg 2)
Final Exam: Information about the final exam are published in: http://www.oec.uzh.ch/en/studies/general/exams/assessment.html
Auxilliary material in the exams:
- At each exam for Informatics II (Midterms, Final Exam) you are allowed to use one A4 sheet with notes (both sides, hand written/ printed/ photocopied).
- A pocket calculator without text storage(memory) like TI-30 XII B/S
Booking and registration for the module:
Module booking tool: All students who wish to obtain credits ( ECTS ) must register electronically in the module booking tool for the module “Informatik II” (AINF1169). Please note the date for the official registration deadline on the website of the module booking tool. The booking of the modules is carried out electronically with the online service of the Student Administration.
OLAT: Additionally, all students must be enrolled on OLAT.