- Syllabus
- List of Important Topics
- Chapter 1 – Introduction
- Chapter 2 – Finite Automata
- Chapter 3 – Context-Free Grammar
- Chapter 4 – Turing Machine
- Chapter 5 – Undecidability
- Chapter 6 – Computational Complexity
Theory of Computation
Take a test
Photo by Steve A Johnson on Unsplash
Old questions with answers and solutions
- Chapter 1: Introduction(12 questions · 7 marks)
- Chapter 2: Finite Automata(25 questions · 21 marks)
- Chapter 3: Context Free Grammar(24 questions · 21 marks)
- Chapter 4: Turing Machine(20 questions · 17 marks)
- Chapter 5: Undecidability(3 questions · 9 marks)
- Chapter 6: Computational Complexity(4 questions · 5 marks)
Handwritten Notes
- Chapter 1 – Introduction
- Chapter 2 – Finite Automata
- Pushdown Automata
- Chapter 4 – Turing Machine
Tutorial
Old Question Solutions
YouTube
- Chapter 1 – Introduction
- Chapter 2 – Finite Automata
- Chapter 3 – Context-Free Languages
- Chapter 4 – Turing Machine
- Chapter 5 – Undecidability
- Chapter 6 – Computational Complexity
