This schedule is, as always, tentative. It will be adapted throughout the term.
| Week | KW | Lecture | Lab | ||||
|---|---|---|---|---|---|---|---|
| 1 | 40 | Tue 05/10/2021 | su_01 | Introduction to the course | Info2: Exercise 00: Programming & Tools | ||
| Wed 06/10/2021 | su_02 | Review: Java Program, Interfaces, Parameters, Data Types and Control Structures, Classes, Arrays, Collections | |||||
| 2 | 41 | Tue 12/10/2021 | su_03 | File-based IO, Exceptions (Lab 03) | Info2: Exercise 01: Application Design | ||
| Wed 13/10/2021 | su_04 | Data Types: Lists | |||||
| 3 | 42 | Tue 19/10/2021 | su_05 | Sets, Bags, Maps | Info2: Exercise 02: Implementing CRC Cards | ||
| Wed 20/10/2021 | su_06 | Stacks | |||||
| 4 | 43 | Tue 26/10/2021 | su_07 | Queues, Priority Queues | Info2: Exercise 03: Histogram | ||
| Wed 27/10/2021 | su_08 | Networking in Java (Prep. Lab 04) | |||||
| 5 | 44 | Tue 02/11/2021 | su_09 | Concurrency | Info2: Exercise 04: Chatterbox | ||
| Wed 03/11/2021 | su_10 | Properties of Algorithms | |||||
| 6 | 45 | Tue 09/11/2021 | (fällt aus) | Info2: Exercise 05: Execution times | |||
| Wed 10/11/2021 | su_11 | (e-learning Python) | |||||
| 7 | 46 | Tue 16/11/2021 | su_12 | Python Intro & Recursion | Info2: Exercise 06: Reverse Polish Notation | ||
| Wed 17/11/2021 | su_13 | Maximum Contiguous Subsequence Sum | |||||
| 8 | 47 | Tue 23/11/2021 | su_14 | Permutations (Permutations.java), Backtracking (TicTacToe.java), | Info2: Exercise 07: Recursive Triangles | ||
| Wed 24/11/2021 | su_15 | Trees | |||||
| 9 | 48 | Tue 30/11/2021 | su_16 | Trees, AVL-Trees | Info2: Exercise 08: Eight Queens | ||
| Wed 01/12/2021 | su_17 | Random numbers - Probabilistic Algorithms | |||||
| 10 | 49 | Tue 07/12/2021 | su_18 | Graphs, Graph Algorithms - S./W.: Algorithms Ch. 4 | Info2: Exercise 09: Probabilistic Algorithms | ||
| Wed 08/12/2021 | su_19 | Graph Algorithms - S./W.: Algorithms Ch. 4 | |||||
| 11 | 50 | Tue 14/12/2021 | su_20 | Finite State Automata see below | Info2: Exercise 10: Getting from A to B | ||
| Wed 15/12/2021 | su_21 | Sorting, see Chapter in Algorithms Book: Sorting | |||||
| 12 | 51 | Tue 21/12/2021 | su_22 | Fun with Python | |||
| Wed 22/12/2021 | — no lecture — | ||||||
| 52 | Tue 28/12/2021 | — no lecture — | |||||
| Wed 29/12/2021 | — no lecture — | ||||||
| 13 | 1 | Tue 04/01/2022 | no lecture | Info2: Exercise 11: Finite State Automata and Sorting Algorithms | |||
| Wed 05/01/2022 | no lecture | ||||||
| 14 | 2 | Tue 11/01/2022 | su_23 su_24 | Searching + String Searching | Info2: Exercise 12: Scrabble Cheater - Basic Edition | ||
| Wed 12/01/2022 | su_25 | Hashing, see also Hash Tables | |||||
| 15 | 3 | Tue 18/01/2022 | Exam Info & Preparation | Info2: Exercise 13: Scrabble Cheater - Deluxe | |||
| Wed 19/01/2022 | su_26 | Character Encodings/Unicode (The Absolute Minimum Every Software Developer … Must Know About Unicode …) , I18n, , Cryptographic Algorithms | |||||
| 16 | 4 | Tue 25/01/2022 | Exam PZ 1 | ||||
| Wed 26/01/2022 | |||||||
| 17 | 5 | Tue 01/02/2022 | |||||
| Wed 02/02/2022 | Klausureinsicht | ||||||
| 18 | 6 | Tue 08/02/2022 | |||||
| Wed 09/02/2022 |
Finite State Automata
Material:
- The course Computer Science: Algorithms, Theory, and Machines, Week 4 on Coursera contains an introduction video on Deterministic Finita Automata (DFA)s: DFAs | Coursera (you will need to register, but accessing the material is free)
- neat example in Python which makes use of Pythons ability to pass functions as pameters for the state transitions: Finite State Machine in Python | Applications Python | python-course.eu
- Note that Finite Automatas are structurally equivalent to State Machines, for an introduction see: UML 2 State Machine Diagrams: An Agile Introduction