Algorithmen und Datenstrukturen
Summer
(in German: Algorithmen und Datenstrukturen )
Module-ID: FIN-INF-110487 |
|
Abbreviation DSA |
Credit Points 10 |
Semester Summer |
Term starting at 2. |
Duration 1 Semester |
Language english |
Level Bachelor |
| Link: | LSF |
| Limited accessability: | |
| Responsibility: | Christian Braune |
| Lecturer: | Christian Braune |
| Classes: |
|
| Applicability in curriculum: | - B.Sc. INF (bilingual): Informatik I - Pflicht - B.Sc. INF (bilingual): Kernmodule (SPO 2027) |
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:
The first assignment may be due in the first week of the semester, which means you can work on the assignment in advance!
This requires prior registration at https://aud.vc.cs.ovgu.de. Registration opens before the semester begins.