The optimal exam preparation based on 100 tasks in theoretical computer science with detailed solutions. Each chapter includes an introduction with a link to the video recording of a corresponding lecture at the Karlsruhe Institute of Technology. Additionally, a forum is available for discussing questions and issues related to all tasks. Topics covered include: formal languages, finite automata with and without output, minimization of finite automata, pushdown automata, Turing machines, right-linear, context-free, monotone/context-sensitive, and general grammars, pumping lemmas, computability and complexity theory, and more.