tbz-repos/aktuelle.kurse
1
0
Fork 0
mirror of https://gitlab.com/harald.mueller/aktuelle.kurse.git synced 2024-11-24 02:31:58 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

muh

Browse Source
This commit is contained in:
Harald G. Mueller 2021-12-01 21:21:24 +01:00
parent cc34e50a2e
commit d622b874b6
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
m411/README.md
View File

@ -8,13 +8,13 @@
## Aufträge & Übungen ## Aufträge & Übungen
| Tag | Titel | Auftrag, Übung, Themen | | Tag | Titel | Auftrag, Übung, Themen |
| ---- | ------ | -------------- | | ---- | ------ | -------------- |
| 1 25.11.21| [First steps](./1) | Modulvorstellung <br>- what is an algorithm <br>- what are data structures <br>-first steps I (classes, main-methode)| | (1) 25.11.21| [First steps](./1) | Modulvorstellung <br>- what is an algorithm <br>- what are data structures <br>-first steps I (classes, main-methode)|
| 2 02.12.21| [file handling](./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) | | (2) 02.12.21| [file handling](./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 09.12.21| [Linked Lists](./3) | follow up arrays <br> linked lists (self made) | | (3) 09.12.21| [Linked Lists](./3) | follow up arrays <br> linked lists (self made) |
| 4 16.12.21| [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) | | (4) 16.12.21| [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 06.01.22| [Hashmaps, Recursions](./5) | - hash maps, <br>- recursions , back tracking | | (5) 06.01.22| [Hashmaps, Recursions](./5) | - hash maps, <br>- recursions , back tracking |
| 6 13.01.22| **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) | | (6) 13.01.22| **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 20.01.22| **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>find a team partner and find a [problem to solve]((./docs/Unterlagen_LB3_MiniProjekte))<br>- [trees and graphs](./7) <br>- [Dijkstra-Algorithm (route planner)](./7) <br>- [xml data, json data](./7) <br>- [page rank algorithm](./7) | | (7) 20.01.22| **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>find a team partner and find a [problem to solve]((./docs/Unterlagen_LB3_MiniProjekte))<br>- [trees and graphs](./7) <br>- [Dijkstra-Algorithm (route planner)](./7) <br>- [xml data, json data](./7) <br>- [page rank algorithm](./7) |
| 8 27.01.22| **LB3** (40% MN) <br> start mini project <br> team of 2 persons | - search and [decide a mini-projekt](./docs/Unterlagen_LB3_MiniProjekte) <br>- work on mini project | | (8) 27.01.22| **LB3** (40% MN) <br> start mini project <br> team of 2 persons | - search and [decide a mini-projekt](./docs/Unterlagen_LB3_MiniProjekte) <br>- work on mini project |
| 9 --------| work on mini project | | | (9) --------| work on mini project | |
| 10 03.02.22| last work and<br>close mini project | **Note 4.0** = "genügend"<br>(d.h. es ist alles da und funktioniert irgendwie, niedrige Komplexität) <br> **Note 5.0** = "gut"<br>(d.h. gut gelöst und funktioniert einwandfrei, adäquate Komplexität) <br> **Note 6.0** = "sehr gut" <br>(übertrifft die Erwartungen, hohe Komplexität) | | (10) 03.02.22| last work and<br>close mini project | **Note 4.0** = "genügend"<br>(d.h. es ist alles da und funktioniert irgendwie, niedrige Komplexität) <br> **Note 5.0** = "gut"<br>(d.h. gut gelöst und funktioniert einwandfrei, adäquate Komplexität) <br> **Note 6.0** = "sehr gut" <br>(übertrifft die Erwartungen, hohe Komplexität) |