mirror of
https://gitlab.com/harald.mueller/aktuelle.kurse.git
synced 2024-11-24 02:31:58 +01:00
| .. | ||
| 1 | ||
| 2 | ||
| 3 | ||
| 4 | ||
| 5 | ||
| 6 | ||
| 7 | ||
| docs | ||
| README.md | ||
M411 - Datenstrukturen und Algorithmen entwerfen und anwenden
Aufträge & Übungen
| Tag | Titel | Auftrag, Übung, Themen |
|---|---|---|
| 1 | First steps | Modulvorstellung - what is an algorithm - what are data structures -first steps I (classes, main-methode) |
| 2 | file handling | first steps II / reading user input (scanner) / reading and writing files (BufferedReader) working with arrays - fill, search, update, delete array elements - sorting (BubbleSort) |
| 3 | Linked Lists | follow up arrays linked lists (self made) |
| 4 | Sort, Stack, Queue | compare sort-algorithms - BubbleSort vs QuickSort - BubbleSort vs ??Sort incl. mesurement the speed - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
| 5 | Hashmaps, Recursions | - hash maps, - recursions , back tracking |
| 6 | LB1 (30% MN) - 30 min on paper and - 60 min coding themes: arrays, stacks, sorts, linked lists |
- follow up hash maps, recursions - collections |
| 7 | LB2 (30% MN) - 30 min on paper and - 60 min coding themes: hash maps and rekursions |
after LB2 start mini project (LB3), find a team partner and find a problem to solve - trees and graphs - Dijkstra-Algorithm (route planner) - xml data, json data - page rank algorithm |
| 8 | LB3 (40% MN) start mini project team of 2 persons |
- search and decide a mini-projekt - work on mini project |
| 9 | work on mini project | |
| 10 | last work and close mini project |
Note 4.0 = "genügend" (d.h. es ist alles da und funktioniert irgendwie, niedrige Komplexität) Note 5.0 = "gut" (d.h. gut gelöst und funktioniert einwandfrei, adäquate Komplexität) Note 6.0 = "sehr gut" (übertrifft die Erwartungen, hohe Komplexität) |