mirror of
https://gitlab.com/harald.mueller/aktuelle.kurse.git
synced 2024-10-19 09:55:03 +02:00
21 lines
1.9 KiB
Markdown
21 lines
1.9 KiB
Markdown
# M411 - Datenstrukturen und Algorithmen entwerfen und anwenden
|
|
|
|
[> **Modulidentifikation** ](https://www.modulbaukasten.ch/modul/bc75c9da-716c-eb11-b0b1-000d3a830b2b)
|
|
|
|
- [docs](./docs/)
|
|
- [docs/Videos-Tutorials-Anleitungen](./docs/Videos-Tutorials-Anleitungen)
|
|
|
|
## Aufträge & Übungen
|
|
| Tag | Titel | Auftrag, Übung, Themen |
|
|
| ---- | ------ | -------------- |
|
|
| 1 | [First steps](./1) | Modulvorstellung <br>- what is an algorithm <br>- what are data structures <br>-first steps I (classes, main-methode)|
|
|
| 2 | [Arrays](./2) | first steps II / reading user input (scanner) / reading and writing files (BufferedReader) <br>working with arrays <br> - fill, search, update, delete array elements <br> - sorting (BubbleSort) |
|
|
| 3 | [Linked Lists](./3) | follow up arrays <br> linked lists (self made) |
|
|
| 4 | [Sort, Stack, Queue](./4) | compare sort-algorithms <br> - BubbleSort vs QuickSort <br> - BubbleSort vs ??Sort <br> incl. mesurement the speed <br> - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
|
|
| 5 | [Hashmaps, Recursions](./5) | - hash maps, <br>- recursions , back tracking |
|
|
| 6 | **LB1** (30% MN) <br>- 30 min on paper and<br>- 60 min coding <br> themes: arrays, stacks, sorts, linked lists | - follow up [hash maps, recursions](./5) <br>- [collections](./6) |
|
|
| 7 | **LB2** (30% MN) <br>- 30 min on paper and<br>- 60 min coding <br> themes: hash maps and rekursions | after LB2 start mini project (LB3)<br>- [trees and graphs](./7) <br>- [Dijkstra-Algorithm (route planner)](./7) <br>- [xml data, json data](./7) <br>- [page rank algorithm](./7) |
|
|
| 8 | **LB3** (40% MN) <br> start mini project | - search and decide projekt <br>- work on mini project |
|
|
| 9 | work on mini project | |
|
|
| 10 | work and close mini project | Abgabe/Vorstellung bei LP |
|