| Detailed information |
| Original study plan |
Bachelor's programme Computer Science 2021S |
| Objectives |
Students are able to think algorithmically. They know the basic static and dynamic data structures, the most important sorting and search algorithms, and the concepts of recursion and random numbers. Furthermore, they are able to analyze the complexity of algorithms with respect to runtime and memory requirements.
|
| Subject |
Programming language is Java. Topics are:
- Complexity
- Lists/Stacks/Queues
- Recursion
- Backtracking
- Trees
- Heaps, Priority Queues
- Sorting
- Digital Sorting
- Strings and Patterns
- Random Numbers
- Randomized Algorithms
|
| Criteria for evaluation |
Exam at the end of term
|
| Methods |
Slide-based presentation
|
| Language |
German |
| Study material |
Slides will be available in the course section in Moodle.
Additional literature will be announced in the course.
|
| Changing subject? |
No |
| Further information |
https://www.pervasive.jku.at/Teaching/
|
| Corresponding lecture |
(*)INBPDVOALG1: VO Algorithmen und Datenstrukturen 1 (3 ECTS) oder 289ALDSAD1V16: VL Algorithmen und Datenstrukturen 1 (3 ECTS)
|
