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

muh

Browse Source
This commit is contained in:
Harald Mueller 2021-12-09 11:53:23 +01:00
parent 956e320318
commit fc4933293a
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
m411/README.md
View File

@ -10,8 +10,8 @@
| ---- | ------ | -------------- |
| (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) |
| (3) 09.12.21| [Linked Lists, Arrays](./3) | follow up arrays <br>working with arrays <br> - fill, search, update, delete array elements <br> linked lists (self made) |
| (4) 16.12.21| [Arrays, (Bubble)Sort, Stack, Queue, RuntimeBehaviour](./4) | - sorting (BubbleSort) <br> - compare sort-algorithms <br> - BubbleSort vs QuickSort <br> - BubbleSort vs ??Sort <br> - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
| (3) 09.12.21| [Linked Lists, Arrays, Stack, Queue](./3) | follow up arrays <br>working with arrays <br> - fill, search, update, delete array elements <br> linked lists (self made) <br> - stack (push, pop) and queues (FIFO, LIFO, LILO, FILO) |
| (4) 16.12.21| [Arrays, (Bubble)Sort, RuntimeBehaviour](./4) | - sorting (BubbleSort) <br> - compare sort-algorithms <br> - BubbleSort vs QuickSort <br> - BubbleSort vs ??Sort |
| (5) 06.01.22| [Hashmaps, Recursions](./5) | - hash maps, <br>- recursions , back tracking <br> - mesurement the speed (runtime behaviour)<br> |
| (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) |