- 9 - 12 October 2018, b-it 0.109 (Michael Nüsken).
- 15 - 19 October 2018, b-it 0.109 (Michael Nüsken).
- 18 - 22 March 2019, b-it 0.109 (Thomas Noll).
- 25 - 29 March 2019, b-it 0.109 (Gerhard Woeginger).
First meeting: Tuesday(!), 9 October, 900.
Schedule: Week 1/2: Mon-Fri 900 - 1230 and 1400 - 1600, each block includes 30 minutes break. (If a course week advances fast, Friday afternoon may be free.)
Week 3/4: Mon-Fri 1000 - 1230 and 1400 - 1700, each block includes 30 minutes break.
- The course takes place at the b-it on Campus Poppelsdorf, Bonn.
- There is no access to any video or audio transmission or recording.
- The courses of the Media Informatics program only start after the first two weeks of the bridging course.
- A similar agreement for the Software Systems Engineering program does not exist, you have to arrange with the collision.
- For some students this course is compulsary. That means: you have to pass the exam eventually. To write it you have two occasions every year, typically in April and June.
The exam will carry the hints displayed on the right.
- Exam1: Friday, 5 April 2019, 1000-1300, b-it bitmax (0.109), (Endenicher Allee 19A).
- Post-Exam1: Tuesday, 7 May 2019, 1300-1400, b-it 2.121.
- Exam2 (repetition): Friday, 7 June 2019, 1000-1300, RWTH Aachen, seminar room 9U10 in building E3 of the computer science center.
- Post-Exam2: Thursday, 1 August 2019, 1100, b-it 2.122 (or later by personal appointment).
The exam is about the entire course. Please note that the second exam is for repetitions.
The exam is offered twice a year. There is no further limit on the number of attempts.
This week will deal essentially with three subjects:
- Linear Algebra (Gauß-Jordan-algorithm, expansion, dim ker A + dim im A = n, ...),
- Probabilities (Definitions, conditional probabilities, random variables, expected runtime of a random exit loop, some applications, ...),
- Integers modulo N (Definition, inversion and extended Euclidean algorithm, square and multiply, exponentiation, Theorem of Lagrange, of Euler and Fermat's little theorem, RSA correctness and efficiency, ...).
You might enjoy solving the geocache Felix Bauklötze.
- foundations (first examples, asymptotic notation, solving recurrence equation)
- sorting (QUICKSORT, sorting in linear time)
- data structures (linked lists, binary search trees)
- graph algorithms (elementary (breadth-first, depth-first), single-source shortest path)
- Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 3rd edition, MIT Press, 2009.
- Goldreich, Computational Complexity: A conceptual perspective, Cambridge University Press, 2008.
- Knuth, TAOCP, Vol. 1 -- Fundamental Algorithms, 3rd edition, Addison-Wesley.
- Formal Languages
- Finite Automata
- Regular Expressions
- Minimization of Deterministic Finite Automata
- The Pumping Lemma
- Context-Free Grammars and Languages
- Context-Free and Regular Languages
- Decidability Problems of Context-Free Languages
- Closure Properties of Context-Free Languages
- Pushdown Automata
- Introduction to computability
- Undecidable problems; halting problem; theorem of Rice
- Recursive enumerability; PCP; Hilbert's tenth problem
- Introduction to complexity
- NP-completeness of selected graph problems
- NP-completeness of selected number problems
Note that all Media informatics courses only start in the third week of the lecturing period, so that everybody can participate in this course.
For some MI-students this course is obligatory, for the others it's optional. There are no credits for this course.