VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

252-0836-00L 4 Credits BSC , DR , MSC D-ITET , D-INFK , D-PHYS
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Computer Science II

Informatik II

Lecturers & Examiners: Dr. Felix Friedrich Wicker, Dr. Malte Schwerhoff
VVZ CR 3.0

Last Updated: 2026-02-05 15:48:04

Abstract

The course provides the foundations for the design and analysis of algorithms.Classical problems ranging from sorting up to problems on graphs are used to discuss common data structures, algorithms and algorithm design paradigms.The course also comprises an introduction to parallel and concurrent programming.

Objective

An understanding of the analysis and design of fundamental and common algorithms and data structures. Knowledge regarding chances, problems and limits of parallel and concurrent programming.

Content

Data structures and algorithms: mathematical tools for the analysis of algorithms (asymptotic function growth, recurrence equations, recurrence trees), informal proofs of algorithm correctness (invariants and code transformation), design paradigms for the development of algorithms (induction, divide-and-conquer, backtracking and dynamic programming), classical algorithmic problems (searching, selection and sorting), data structures for different purposes (linked lists, hash tables, balanced search trees, heaps, union-find), further tools for runtime analysis (generating functions, amortized analysis. The relationship and tight coupling between algorithms and data structures is illustrated with graph algorithms (traversals, topological sort, closure, shortest paths, minimum spanning trees). Parallel programming: structure of parallel architectures (multicore, vectorization, pipelining) concepts of parallel programming (Amdahl's and Gustavson's laws, task/data parallelism, scheduling), problems of concurrency (data races, bad interleavings, memory reordering), process synchronisation and communication in a shared memory system (mutual exclusion, semaphores, monitors, condition variables). The concepts are underpinned with examples of concurrent and parallel programs and with parallel algorithms, implemented in C++. In general, the concepts provided in the course are motivated and illustrated with practically relevant algorithms and applications. Exercises are carried out in Code-Expert, an online IDE and exercise management system. All required mathematical tools above high school level are covered, including a introduction to graph theory.

Resources

Lecture Notes

tba

Literature

Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms, 3rd ed., MIT Press, 2009. ISBN 978-0-262-03384-8 (recommended text) B. Stroustrup, The C++ Programming Language (4th Edition) Addison-Wesley, 2013.

Learning Materials (Links)

General Information

Language
German
Levels
BSC , DR , MSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 120 minutes
Aids
Sie dürfen maximal 4 A4-Blätter mit in die Prüfung nehmen. Inhaltliche und formale Anforderungen (Text, Bilder, ein-/doppelseitig, Ränder, Schriftgrösse, etc.) bestehen nicht. Elektronische Geräte bzw. digitale Unterlagen sind nicht erlaubt.You may take up to 4 A4 sheets into the exam. There are no constraints regarding content and layout (text, images, single/double page, margins, font size, etc.). Electronic devices and digital documents are not allowed.
Durch Bearbeitung der wöchentlichen Übungsserien kann ein Bonus von maximal 0.25 Notenpunkten erarbeitet werden, der an die Prüfung mitgenommen wird. Der Bonus ist proportional zur erreichten Punktzahl von speziell markierten Bonus-Aufgaben, wobei volle Punktzahl einem Bonus von 0.25 entspricht. Die Zulassung zu speziell markierten Bonusaufgaben kann von der erfolgreichen Absolvierung anderer Übungsaufgaben abhängen. Der erreichte Notenbonus verfällt, sobald die Vorlesung neu gelesen wird.Die Prüfung wird voraussichtlich am Computer durchgeführt.

Course Components

Type Title Time & Place Hours
lecture Informatik II
  • Thu 10:15-12:00 (HG E 7)
2 h weekly
exercise Informatik II
  • Fri 16:15-18:00 (CHN D 42)
  • Fri 16:15-18:00 (CHN D 44)
  • Fri 16:15-18:00 (CHN D 46)
  • Fri 16:15-18:00 (CHN D 48)
  • Fri 16:15-18:00 (LFW B 3)
  • Fri 16:15-18:00 (LFW C 1)
  • Fri 16:15-18:00 (LFW C 11)
  • Fri 16:15-18:00 (LFW C 4)
  • Fri 16:15-18:00 (LFW E 13)
2 h weekly

Offered In