UPB Bildmarke
Theory of Distributed Systems
Contact
  • Deutsch
  • English
    • Open Page "Teaching"
      • Open Page "Courses"
      • SS 2025
      • Past Semester
      • Open Page "Research Seminar"
      • WS 2024/2025
        • Open Page "Past Semester"
        • SS 2024
        • WS 2023/2024
        • SS 2023
        • WS 2022/2023
        • SS 2022
        • WS 2021/2022
        • SS 2021
        • WS 2020/2021
        • WS 2019/2020
        • WS 2018/2019
        • SS 2018
        • WS 2017/2018
        • SS 2017
        • WS 2016/2017
        • SS 2016
      • Open Page "Theses"
      • Bachelor- and Mastertheses
    • Open Page "Research"
      • Open Page "Research Areas"
      • Programmable Matter
      • Current Projects
      • Future Projects
      • Closed Projects
      • Open Page "Open Source Projects"
      • AmebotSim 2.0
      • Open Page "Publications"
      • Publications of the research group
    • Open Page "Team"
      • Open Page "Group"
      • Job Offers
      • Where to find us
    • SHK + WHB
    • Open Page "Institut"
      • Open Page "Institut für Informatik"
      • Institut für Informatik
  1. Faculty of Computer Science, Electrical Engineering and Mathematics
  2. Institute of Computer Science
  3. Research Group Theory of Distributed Systems
  4. Teaching
  5. Past Semester
  6. SS 2018
  7. Premaster Algorithms 1

Premaster Course Algorithms 1

Lecturer: Prof. Dr. Christian Scheideler

Time and Location:

  • Mo, 18-20, room F1.110, April 9 - May 28

Examination:

Oral exam on the contents of the course.

Contents:

The course is organized as a reading class based on the following book

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms (Third Edition), MIT Press, 2009.

The participants are expected to have access to this book so that they can prepare for the lectures. We will cover the following chapters during the course:

  • April 9: Chapters 1-4 (Introduction and Runtime Analysis)
  • April 16: Chapters 6-7 (Sorting)
  • April 23: Chapters 10-12 (Elementary Data Structures)
  • April 30: Chapters 15-16 (Dynamic Programming and Greedy Algorithms)
  • May 7: Chapters 22-23 (Basic Graph Algorithms)
  • May 14: Chapters 24-25 (Shortest Paths)
  • May 28: Chapter 26 (Network Flow)

 

Theory of Distributed Systems

Fürstenallee 11
Room F2.411
33102 Paderborn
Germany

Phone:

+49 5251 60-6481
Universität Paderborn

Warburger Str. 100
33098 Paderborn
Germany

Phone University

+49 5251 60-0
Legal notice
  • Imprint
  • Data privacy
  • Whistleblower system
Social networks