Lesson 1: Overview and Foundations of Theoretical Computer Science

Test Module 1

Lesson 2: Regular Languages and Finite Automata

Lesson 3: Context-Free Grammars and Pushdown Automata

Lesson 4: Turing Machines and the Church-Turing Thesis

Lesson 5: Decidability and Undecidability

Test Module 2

Lesson 6: Turing Machines and Theory of Computation

Lesson 7: Halting Problem and Undecidable Problems

Lesson 8: Introduction to Recursive and Recursively Enumerable Languages

Test Module 3

Lesson 9: Computational Complexity

Lesson 10: Reductions and NP-Hardness

Test Module 4

Lesson 15: Formal Verification and Model Checking

Lesson 16: Compiler Design and Parsing

Lesson 17: DNA Computing and Quantum Computing

Lesson 18: Connections between Theoretical Computer Science and Other Disciplines

Test Module 6