# Algorithms and Data Structures

##### Summer 


##### (in German: Algorithmen und Datenstrukturen )

<table bgcolor="#7FB3D9" border="1" id="bkmrk-%5Btitle%5D" style="width: 100%; border-collapse: collapse; border-width: 1px; border-style: none;"><colgroup><col style="width: 100%;"></col></colgroup><tbody><tr style="background-color: rgb(235, 243, 249);"><td>##### <span style="color: rgb(0, 104, 180);">**Module-ID:** </span><span style="color: rgb(0, 104, 180);">**FIN-INF-110487** </span>

</td></tr></tbody></table>

<table bgcolor="#7FB3D9" border="1" id="bkmrk-" style="border-collapse: collapse; width: 100%;"><colgroup><col style="width: 14.2515%;"></col><col style="width: 14.2515%;"></col><col style="width: 13.061%;"></col><col style="width: 15.442%;"></col><col style="width: 14.2515%;"></col><col style="width: 14.2515%;"></col><col style="width: 14.2515%;"></col></colgroup><tbody><tr><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Abbreviation**</span>

<span style="color: rgb(61, 61, 61);">DSA </span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Credit Points**</span>

<span style="color: rgb(61, 61, 61);">10 </span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Semester**</span>

<span style="color: rgb(61, 61, 61);">Summer </span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Term**</span>

<span style="color: #3d3d3d;">starting at 2. </span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);">**<span style="color: rgb(61, 61, 61);">Duration</span>**

<span style="color: rgb(61, 61, 61);">1 Semester </span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Language**</span>

<span style="color: rgb(61, 61, 61);">english</span>

</td><td class="align-center" style="border: 5px solid rgb(255, 255, 255);"><span style="color: rgb(61, 61, 61);">**Level**</span>

<span style="color: rgb(61, 61, 61);">Bachelor </span>

</td></tr></tbody></table>

<table border="1" id="bkmrk-verantwortung%3A-verwe" style="border-collapse: collapse; width: 100%; height: 124.8px; border-width: 1px; border-style: none;"><colgroup><col style="width: 24.7879%;"></col><col style="width: 75.2121%;"></col></colgroup><tbody><tr style="height: 35.4px;"><td style="height: 35.4px;">**Link:**</td><td style="height: 35.4px;">[ LSF](https://lsf.ovgu.de/qislsf/rds?state=wsearchv&search=1&subdir=veranstaltung&veranstaltung.semester=20261&veranstaltung.dtxt=Algorithmen+und+Datenstrukturen&P_start=0&P_anzahl=30&P.sort=veranstaltung.dtxt&_form=display "Algorithmen und Datenstrukturen")</td></tr><tr><td>**Limited accessability:**</td><td>false </td></tr><tr style="height: 29.8px;"><td style="height: 29.8px;">**Responsibility:**</td><td style="height: 29.8px;">Christian Braune </td></tr><tr style="height: 29.8px;"><td style="height: 29.8px;">**Lecturer:**</td><td style="height: 29.8px;">Christian Braune </td></tr><tr><td>**Classes:**</td><td>- Lecture *Algorithms and Data Structures*
- Exercise *Algorithms and Data Structures*
- Tutorial *Algorithms and Data Structures*

 </td></tr><tr style="height: 29.8px;"><td style="height: 29.8px;">**Applicability in curriculum:**</td><td style="height: 29.8px;">- B.Sc. INF (bilingual): Informatik I - Pflicht  
- B.Sc. INF (bilingual): Kernmodule (SPO 2027)  
  
</td></tr></tbody></table>

**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

<table border="1" id="bkmrk-studien-%2Fpr%C3%BCfungslei" style="border-collapse: collapse; width: 100%;"><colgroup><col style="width: 32.0641%;"></col><col style="width: 34.9204%;"></col><col style="width: 33.0155%;"></col></colgroup><tbody><tr><td>**Pre-examination requirements:**</td><td>**Type of examination:**</td><td>**Teaching method / lecture hours per week (SWS):**</td></tr><tr><td>In order to be able to take part in the exam, preliminary work is required. Details will be announced in the first lecture.

</td><td>Written exam 120 minutes

</td><td>- Lecture (4 SWS)
- Exercise (2 SWS)
- Tutorial (1 SWS)

</td></tr></tbody></table>

<table border="1" id="bkmrk-voraussetzungen-nach" style="font-family: var(--font-body); font-size: 14px; width: 100%;"><colgroup><col style="width: 50%;"></col><col style="width: 50%;"></col></colgroup><tbody><tr><td>**Prerequisites according to examination regulations:**</td><td>**Recommended prerequisites:**</td></tr><tr><td>none

</td><td>- Programming skills in Java, including Object Oriented Programming and Abstract Data Types
- Basic understanding of algorithms, including understanding of recursion
- Understanding of runtime/cost of algorithms and its formal representation (e.g., Big-O notation)
- Understanding basic methods of proof (e.g., proof by induction)

</td></tr></tbody></table>

<table border="1" id="bkmrk-medienformen%3A-litera" style="border-collapse: collapse; width: 100%;"><colgroup><col style="width: 50%;"></col><col style="width: 50%;"></col></colgroup><tbody><tr><td>**Media:**</td><td>**Literature:**</td></tr><tr><td></td><td>- Saake &amp; Sattler: Algorithmen und Datenstrukturen
- Goodrich, Tamassia &amp; Goldwasser: Data Structures and Algorithms in Java
- Sedgewick &amp; Wayne: Algorithms
- Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms

  
</td></tr></tbody></table>

**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](https://aud.vc.cs.ovgu.de). Registration opens before the semester begins.