Module Number

INFM2420 		Module Title

Theoretical Computer Science 1: Algorithms and Data Structures (formerly Algorithms) 		Type of Module

Compulsory
ECTS 9
Work load
- Contact time
- Self study
Workload:
270 h
Class time:
90 h / 6 SWS
Self study:
180 h
Duration 1 Semester
Frequency In the winter semester
Language of instruction German
Type of Exam

Written Test
Lecture type(s) Lecture
Content

Introduction: computational models, efficiency measures;
sorting methods: Quicksort, Heapsort, Mergesort;
Elementary data structures: lists, trees, graphs, dynamic search structures, hashing;
Graph algorithms: Patterning, shortest paths, spanning trees;
Algorithms on strings: pattern search;
Programming: learned algorithms and data structures.
Objectives

Students have basic knowledge of fundamental data structures in computer science and of algorithms for fundamental problems. Within this framework, they are familiar with the independent creative development of algorithms and data structures. The students know the interactions between data structures and algorithms and can apply these to concrete examples. Based on the analysis techniques they have learned, they can evaluate simple algorithmic approaches according to their quality, efficiency and complexity. In addition, students are able to implement the algorithms and data structures they have learned.
Allocation of credits / grading
Type of Class
Status
SWS
Credits
Type of Exam
Exam duration
Evaluation
Calculation
of Module (%)
Lecture
V
o
4
6.0
wt
90
g
100
Tutorial
Ü
o
2
3.0
Prerequisite for participation INFM1010 Mathematics for Computer Science 1: Analysis,

INFM1020 Mathematics for Computer Science 2: Linear Algebra,

INFM1110 Practical Computer Science 1: Declarative Programming,

INFM1120 Practical Computer Science 2: Imperative and Object-Oriented Programming
Lecturer / Other Kaufmann, Schlipf, von Luxburg
Literature

-
Last offered Wintersemester 2022
Planned for Wintersemester 2024
Assigned Study Areas BIOINFM, INFM, MDZINFM2510, MEINFM