B7 Informatics 2 SoSe 2020

Website of Prof. Dr. Barne Kleinen, Professor for Media Informatics (Bachelor/Master) at HTW Berlin

Info2 WS2018 Topics and Grading Draft

     <prev

This is just the draft!! see the final version

Rough Overview: Percent and Topic

Properties(Complexity) of Algorithms

10-15 Abstract Data Types / Data Structures

  • Queue, Stack, List, Set, Directory/Map, Bags, Trees, Binary Search Trees
  • The Java Collection Framework

10 Graphs

  • Graph Algorithms: Breath-First and Depth-First Search
  • Dijkstra: cheapest path between start and end

10 Complexity of Algorithms Maximum Contiguous Subsequence Sum

File I/O 5 Networking in Java (Sockets)

Concurrency 5 Rekursion

5 Divide & Conquer 5 Random numbers, Probabilistic Algorithms

5 Finite State Automata (Grammars)

20 Sorting: pseudocode / in worten beschreiben oder daran erkennen, manual walkthroughs, Complexity

  • Radixsort l * n
  • Mergesort n log n
  • Quicksort n log n
  • Heapsort n log n
  • Insertion Sort
  • Bogo Sort
  • Selection Sort
  • Cocktail Shaker

10 (String) Searching

  • Binary Search
  • Linear Search
  • String Searching
    • KMP (Skip Searching)

String Searching and Pattern Matching

Offen: Searching, Scanning and Parsing Algorithms
AVL Trees Python