Info2 WS2018 Topics and Grading
Sum: 115% - There might be questions that count in two categories - eg. the Complexity of a searching algorithm.
| 115 | Lecture Topic |
|---|---|
| 10 | Properties, especially Complexity of Algorithms |
| 20 | Abstract Data Types / Data Structures |
| - Queue, Stack, List, Set, Directory/Map, Bags, Trees, Binary Search Trees, AVL Trees | |
| - The Java Collection Framework | |
| 15 | Graphs and Graph Algorithms |
| Graph Data Structure | |
| Graph Algorithms: Breath-First and Depth-First Search | |
| paths Dijkstra: cheapest path between start and end | |
| 20 | 2-3 aus: |
| File I/O andNetworking in Java (Sockets) | |
| Maximum Contiguous Subsequence Sum | |
| Concurrency | |
| Rekursion | |
| Divide & Conquer | |
| Random numbers, Probabilistic Algorithms | |
| Finite State Automata (Grammars) | |
| 25 | Sorting: pseudocode / in worten beschreiben oder daran erkennen, manual |
| - Radixsort l * n | |
| - Mergesort n log n | |
| - Quicksort n log n | |
| - Heapsort n log n | |
| - Insertion Sort | |
| - Bogo Sort | |
| - Selection Sort | |
| - Cocktail Shaker | |
| 15 | Searching and String Searching |
| - Binary Search | |
| - Linear Search | |
| - String Searching | |
| - KMP (Skip Searching) | |
| 10 | Python |