263-0006-00L Algorithms Lab
| Semester | Autumn Semester 2020 |
| Lecturers | E. Welzl |
| Periodicity | yearly recurring course |
| Language of instruction | English |
| Comment | Only for master students, otherwise a special permission by the student administration of D-INFK is required. |
Courses
| Number | Title | Hours | Lecturers | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 263-0006-00 P | Algorithms Lab The lecturers will communicate the exact lesson times of ONLINE courses. | 4 hrs |
| E. Welzl | ||||||||||||
| 263-0006-00 A | Algorithms Lab Project Work, no fixed presence required. | 3 hrs | E. Welzl |
Catalogue data
| Abstract | Students learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials. |
| Learning objective | The objective of this course is to learn how to solve algorithmic problems given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them (using C/C++, STL, CGAL, and BGL). |
| Literature | T. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990. J. Hromkovic, Teubner: Theoretische Informatik, Springer, 2004 (English: Theoretical Computer Science, Springer 2003). J. Kleinberg, É. Tardos: Algorithm Design, Addison Wesley, 2006. H. R. Lewis, C. H. Papadimitriou: Elements of the Theory of Computation, Prentice Hall, 1998. T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum, 2012. R. Sedgewick: Algorithms in C++: Graph Algorithms, Addison-Wesley, 2001. |
Performance assessment
| Performance assessment information (valid until the course unit is held again) | |
Performance assessment as a semester course | |
| ECTS credits | 8 credits |
| Examiners | E. Welzl |
| Type | session examination |
| Language of examination | English |
| Repetition | The performance assessment is offered every session. Repetition possible without re-enrolling for the course unit. |
| Mode of examination | written 180 minutes and 180 minutes |
| Additional information on mode of examination | Every student who completes all three assessments (read: shows up at the specified time and completes the process by giving feedback to the assistant in the electronic system) receives a bonus in form of a quarter-grade (+0.25) on their grade from the final exam. |
| Written aids | No documentation is allowed during the exam except what is provided by the system itself. |
| Digital exam | The exam takes place on devices provided by ETH Zurich. |
| This information can be updated until the beginning of the semester; information on the examination timetable is binding. | |
Learning materials
| No public learning materials available. | |
| Only public learning materials are listed. |
Groups
| No information on groups available. |
Restrictions
| Places | 300 at the most |
| Priority | Registration for the course unit is until 24.09.2020 only possible for the primary target group |
| Primary target group | Cyber Security MSc (260000)
Cyber Security MSc (EPFL) (260100) Data Science MSc (261000) Computer Science MSc (263000) |
| Waiting list | until 28.09.2020 |
Offered in
| Programme | Section | Type | |
|---|---|---|---|
| Cyber Security Master | Interfocus Courses | W |  |
| Data Science Master | Core Electives | W | |
| Computer Science Master | Interfocus Courses | O | |