BS Computer Science Theory of Automata MCQs

Chapter-wise multiple choice questions with answers. 500 questions in 10 chapters.

About these Theory of Automata MCQs

These multiple choice questions cover BS Computer Science Theory of Automata in 10 chapters, with 500 questions in all. Every question has four options and a marked correct answer, and many have a short explanation.

The chapters are: Foundations; Finite Automata; NFA and Equivalence; Regular Expressions; Regular Languages; Context Free Grammars; Pushdown Automata; Context Free Languages; Turing Machines; Computability. The longest chapter is "Foundations" with 50 questions.

Read a chapter with its answers to revise, then take its quiz to check yourself. The whole-subject quiz mixes questions from several chapters, which is closer to a real test.