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

252-0851-00L 4 Credits BSC , DR , MSC D-INFK , D-MATH

Algorithms and Complexity

Algorithmen und Komplexität

Wird zum letzten Mal angeboten.
VVZ CR n/a

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

Abstract

Introduction: RAM machine, data structures; Algorithms: sorting, median, matrix multiplication, shortest paths, minimal spanning trees; Paradigms: divide & conquer, dynamic programming, greedy algorithms; Data Structures: search trees, dictionaries, priority queues; Complexity Theory: P and NP, NP-completeness, Cook's theorem, reductions, cryptography and zero-knowledge proofs.

Objective

After this course students know some basic algorithms as well as underlying paradigms. They will be familiar with basic notions of complexity theory and can use them to classify problems.

Content

Die Vorlesung behandelt den Entwurf und die Analyse von Algorithmen und Datenstrukturen. Die zentralen Themengebiete sind: Sortieralgorithmen, Effiziente Datenstrukturen, Algorithmen für Graphen und Netzwerke, Paradigmen des Algorithmenentwurfs, Klassen P und NP, NP-Vollständigkeit, Approximationsalgorithmen.

Resources

Lecture Notes

Ja.

General Information

Language
German
Levels
BSC , DR , MSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 120 minutes
Aids
10 handgeschriebene Din A4 Blätter

Course Components

Type Title Time & Place Hours
lecture Algorithmen und Komplexität
  • Tue 08:15-10:00 (HG D 1.2)
2 h weekly
exercise Algorithmen und Komplexität
Groups are selected in myStudies.
  • Wed 12:15-13:00 (CHN D 44)
  • Wed 12:15-13:00 (CHN D 46)
  • Wed 12:15-13:00 (CHN E 42)
  • Wed 13:15-14:00 (CHN D 44)
  • Wed 13:15-14:00 (CHN D 46)
  • Wed 13:15-14:00 (CHN E 42)
1 h weekly

Offered In