tbz-repos/aktuelle.kurse
1
0
Fork 0
mirror of https://gitlab.com/harald.mueller/aktuelle.kurse.git synced 2024-11-27 12:11:57 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity
aa18c33d24
aktuelle.kurse/m411
History
harald.mueller@tbz.ch 81ef40a30e muh
2021-08-07 01:05:19 +02:00
..
1 muh 2021-08-07 00:11:44 +02:00
2 muh 2021-08-06 23:32:21 +02:00
3 muh 2021-08-07 00:11:44 +02:00
4 muh 2021-08-06 22:55:15 +02:00
5 muh 2021-08-06 22:55:15 +02:00
6 muh 2021-08-06 21:40:32 +02:00
7 muh 2021-08-06 22:45:26 +02:00
docs muh 2021-08-07 01:05:19 +02:00
README.md muh 2021-08-07 00:50:35 +02:00

README.md

M411 - Datenstrukturen und Algorithmen entwerfen und anwenden

> Modulidentifikation

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),
find a team partner and a problem to solve
- trees and graphs
- Dijkstra-Algorithm (route planner)
- xml data, json data
- page rank algorithm
8 LB3 (40% MN)
start mini project
team of 2 persons		 - search and decide projekt
- work on mini project
9 work on mini project
10 last work and
close mini project		 Note 4.0 = "genügend"
(d.h. es ist alles da und funktioniert irgendwie, niedrige Komplexität)
Note 5.0 = "gut"
(d.h. gut gelöst und funktioniert einwandfrei, adäquate Komplexität)
Note 6.0 = "sehr gut"
(übertrifft die Erwartungen, hohe Komplexität)