Algorithms and Data Structures
Summer
(in German: Algorithmen und Datenstrukturen )
Module-ID: FIN-INF-1103612 |
| Link: | LSF |
| Responsibility: | Christian Braune |
| Lecturer: | Christian Braune |
| Classes: |
|
| Applicability in curriculum: | - B.Sc. INF: Informatik I - Pflicht - B.Sc. CV: Informatik I - Pflicht - B.Sc. INGINF: Informatik I - Pflicht - B.Sc. WIF: Gestalten - Pflicht - B.Sc. INF (bilingual): Informatik I - Pflicht |
|
Abbreviation DSA |
Credit Points 10 |
Semester Summer |
Term ab 2. |
Duration 1 Semester |
Language english |
Level Bachelor |
Intended learning outcomes:
The students
- know and understand the most important basic data structures and algorithms on these
- are able to apply these and assess which are (better) suited to a specific application
- understand predefined and create their own implementations
Content:
- Lists
- Trees
- Balanced search trees
- Heaps
- Hash method
- Graphs
- Dynamic programming
- Search in texts
- Design and analysis of algorithms
Workload:
106h attendance + 194h independent work
| Pre-examination requirements: | Type of examination: | Teaching method / lecture hours per week (SWS): |
|
In order to be able to take part in the exam, preliminary work is required. Details will be announced in the first lecture. |
Written exam 120 minutes |
|
| Prerequisites according to examination regulations: | Recommended prerequisites: |
|
none |
|
| Media: | Literature: |
|
Comments: