Algorithms and Object-Oriented Programming (ILV)
BackSpecialization Area | Informatics |
Course number | B2.08510.20.013 |
Course code | AlgOOP |
Curriculum | 2022 |
Semester of degree program | Semester 2 |
Mode of delivery | Presence- and Telecourse |
Units per week | 3,5 |
ECTS credits | 5,0 |
Language of instruction | German |
The students know the language constructs for managing dynamically requested memory and are able to use the data structures list and binary tree in practical applications.
The students know different sorting and search algorithms for fields and can apply them accordingly.
The course gives an overview of dynamic data structures, elementary algorithms for searching and sorting, and an insight into the computation of runtime complexity of algorithms.
Accordingly, the following key topics will be addressed:
- Fundamentals of runtime complexity of algorithms
- Basics of dynamic memory management
- Dynamic data structures:
- List (Stack, Queue)
- Tree
- Search and sort algorithms for fields (from Selection-Sort to Mergesort)
- simple algorithms on graphs if necessary
The following basic literature will be used in the course:
- G. Pomberger, H. Dobler: "Algorithms and Data Structures: A Systematic Introduction to Programming", Pearson Studium, 2008;
Lecture with subsequent exercises, accompanying tutorial offered (see Course Repetitorium LVNr: B2.09100.10.014).
Final grade comprised of
- Class participation
- Partial tests (continuous assessment)