This class is a first introduction to Computer Science.
Introduction, Boolean algebra (see notes, Wikipedia article on Boolean algebra)
Boolean algebra (ctd.), binary logic and logic gates (see notes)
Discussion of Exercise Sheet 1 - solutions; positional number systems (begin, see notes)
Discussion of Exercise Sheet 2 - solutions; positional number systems (ctd., see notes)
Integer representations, two’s complement (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.)
Mitigation of floating point issues; character encodings (start): ASCII (see notes)
Discussion of Exercise Sheet 4 - solutions; character strings; from ASCII to Unicode (for background reading, see Wikipedia article on Unicode, discussion of C vs. Pascal strings on Stack Overflow)
No class, please watch this short video on UTF-8, and this introduction to finite state machines
Discussion of Exercise Sheet 5; finite state machines (begin, see notes, slides from Uni Tübingen)
Finite state machines (ctd.)
Discussion of Exercise Sheet 6; regular expressions (Regular expressions and FSMs from Isaac Computer Science; further background reading: Regular Expression Matching Can Be Simple And Fast); Conversion from non-deterministic to deterministic FSMs; conversion from regular expressions to FSMs and back
Beyond regular languages (notes; for background reading, see Chomsky hierarchy, Turing machine and a nice elementary discussion with a bit more details than covered in the book by Forouzan, Chapter 17.
Discussion of Exercise Sheet 7; quick overview on computer architectures, for background reading see Moore’s law, (breakdown of) Dennard scaling. For more background on instruction set architectures, please watch the video from the 2017 Turing award lecture and/or read the edited transcript.
Operating systems (begin): Memory management, process scheduling, concurrency (notes; Forouzan, Chapter 7)
Dining philosophers problem (see Wikipedia; for background reading, see the original Chandy/Misra paper, the Dijkstra/Tannenbaum solution - not covered in class - can be found in more readable pseudocode here)
File systems: mounting, soft links vs. hard links, network file systems (brief mention), RAID (see class notes)
Discussion of Exercise Sheet 8; file systems (ctd.)
Error detection and correction: Parity, Checksums, Hamming codes (see class notes; also see this online Hamming code calculator; background video on cyclic checksums which explains the concept in more detail than covered in class)
Discussion of Exercise Sheet 9; error detection and correction (ctd.)
Discussion of Exercise Sheet 10; Computer networks (For background reading, see Forouzan, Chapter 6 or this slide stack from FRA-UAS)
Routing algorithms: link state routing (see class notes)
Mock Exam
Routing algorithms ctd.: distance vector routing; Introduction to relational databases: motivation, relations, tuples, attributes, domains (see, e.g., Lecture 1 from this course)
Relational algebra and simple SQL queries (see, e.g., Lecture 2 from this course or Lecture 18 from this course); for example databases for use with Libreoffice Base, see here
Discussion of Exercise Sheet 11; further practice problems for the final exam