| Week/Woche | Info | Sheets NL | Folien DE |
|---|---|---|---|
| 1 | Introduction | introduction_handout_nl.pdf | introduction_handout_de.pdf |
| 1 | Complexity, empirical and analytical studies | complexity_handout_nl.pdf | complexity_handout_de.pdf |
| 2 | Data structures 1: arrays and linked lists | datastructures1_handout_nl.pdf | datastructures1_handout_de.pdf |
| 2 | Data structures 2: ADT's, stacks and queues | datastructures2_handout_nl.pdf | datastructures2_handout_de.pdf |
| 3 | Recursion | recursion_handout_nl.pdf | recursion_handout_de.pdf |
| 3 | Tree traversal | treetraversal_handout_nl.pdf | treetraversal_handout_de.pdf |
| 4 | Divide and conquer | divide_conquer_handout_nl.pdf | divide_conquer_handout_de.pdf |
| 5 | Basic sorting | basic-sorting_handout_nl.pdf | basic-sorting_handout_de.pdf |
| 6 | Quicksort | quicksort_handout_nl.pdf | quicksort_handout_de.pdf |
| 6 | Heapsort | heapsort_handout_nl.pdf | heapsort_handout_de.pdf |
| 7 | Dynamic programming | dynamic_programming_handout_nl.pdf | dynamic_programming_handout_de.pdf |
| Nr | Deadline | Assessment | Info | NL | DE |
|---|---|---|---|---|---|
| 1 | thu 18 sep | tue 23 sep & thu 25 sep | Stacks en Queues - Keller und Warteschlangen | Opgave | Aufgabe |
| 2 | thu 9 okt | tue 21 okt & thu 23 okt | Bomen - Bäume | Opgave | Aufgabe |
| 3 | fri 31 oct 10:00 h | tue 4 nov | Sorteren - Sortieren | Aufgabe |
Eintelung der Gruppen: here.If you have any questions concerning ALDA, feel free and contact us