Algorithms and Data Structures (CS 210) is a first-year module covering the fundamental algorithms and data structures of computer science. Apart from learning about the theoretical basic toolbox, we will also implement the algorithms and data structures in modern Java.

Slido  ⋅  YouTube  ⋅  ILIAS  ⋅  Campuswire  ⋅  Units

Topics

  • asymptotic notation and analysis
  • sorting algorithms
  • lists, stacks, queues
  • binary search trees
  • hashing
  • graph traversal

The module is taught in German.

Lectures

Lectures are live-streamed and recorded on a best-effort basis (YouTube Channel).
Live participation in the synchronous lectures is expected.

Lecture slots and rooms are found on Marvin.
Times on Marvin are c.t. (start is 15min past the full hour).

Units

The module will consist of the following units; each will have a unit subpage (linked in the table) with slides, lecture notes, and video recordings for that unit.

Week w/c (Mon) Lecture Topics Exercise Sheet
1 2025-04-13 Unit 0: Administrativa  
    —no lecture on Wed 15 April—  
2 2025-04-20    
3 2025-04-27    
4 2025-05-04    
5 2025-05-11    
6 2025-05-18    
7 2025-05-25    
    Whit Monday $\to$ no classes on 25 May  
8 2025-06-01    
9 2025-06-08    
10 2025-06-15    
11 2025-06-22    
12 2025-06-29    
13 2025-07-06    
14 2025-07-13 Recap, Exam Q&A  

Tutorials (Übungen)

There will be weekly exercises sheets with practice problems and group submissions. Further details will be given in class.

Solutions are discussed in small-group tutorials, check ILIAS for your group assignment.

Online Tools

We will use several tools and services that have proven effective for this module.

Campuswire

Campuswire is our main online communication channel.
Any questions relating to the module should be posted on Campuswire on the question & answer forum, the “class feed”. You can post anonymously if you prefer, and you are encouraged to answer each other’s questions, as well!

You can also use the platform for (social or topical) discussions in the chat rooms.

ILIAS

We will use the university’s official learning management system ILIAS for examination-related information and marks.

Slido

During the live lectures, I will use Slido for interactive parts.

Exam & Assessment

The module mark is based on the final examination. Exam dates are centrally set and can be seen on Marvin.

To be admitted to the exam, you must achieve a passing grade in the tutorials. More details will be given in class.

Other resources