This class is a first introduction to Computer Science.
Introduction, Boolean algebra (see notes, Wikipedia article on Boolean algebra)
Discussion of Exercise Sheet 1 - solutions; binary logic and logic gates (see notes)
No class due to conflicting admin meeting
Example for circuit simplification; flip-flop (see animation of RS flip-flop); Integer representations, two’s complement, positional number systems (see notes)
Discussion of Exercise Sheet 2 - solutions; positional number systems (ctd., see notes)
Floating point arithmetic (notes, see the floating-point converter for a nice illustration of the bit format; more background can be found in the Wikipedia article on floating point arithmetic and, far more advanced, the paper by Goldberg titled What Every Computer Scientist Should Know About Floating-Point Arithmetic)
Discussion of Exercise Sheet 3 - solutions; floating point arithmetic (ctd.)
Character strings; from ASCII to Unicode (for background reading, see Wikipedia article on Unicode, discussion of C vs. Pascal strings on Stack Overflow), short video on UTF-8
Discussion of Exercise Sheet 4 - solutions; character strings (ctd.)
Finite state machines (begin, see notes, slides from Uni Tübingen, introductory video)
Discussion of Exercise Sheet 5 - solutions; regular expressions; conversion from non-deterministic to deterministic FSMs
