This commit is contained in:
Harald Mueller 2021-12-09 11:46:21 +01:00
parent 2af5f3ed80
commit 132c450324

View File

@ -9,8 +9,8 @@
| 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)|
| (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, Arrays](./3) | follow up arrays <br> linked lists (self made) |
| (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> - sorting (BubbleSort) <br> linked lists (self made) |
| (4) 16.12.21| [Arrays, (Bubble)Sort, Stack, Queue, RuntimeBehaviour](./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 |
| (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) |