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	Arrays	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) - trees and graphs - Dijkstra-Algorithm (route planner) - xml data, json data - page rank algorithm
8	LB3 (40% MN) start mini project	- search and decide projekt - work on mini project
9	work on mini project
10	work and close mini project	Abgabe/Vorstellung bei LP