🔬
GATE CS - Theory of Computation
Practice finite automata, context-free grammars, Turing machines, and complexity
50 questions•5 pages•~75 min
Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.
A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.
Progress: 0 / 500%
Page 3 of 5 • Questions 21-30 of 50
Q21easy
What is the minimum number of states in a DFA accepting {0, 1}*?
Q22medium
What is the purpose of a Universal Turing Machine?
Q23easy
What is the relationship between DFA and NFA?
Q24medium
What is the purpose of reduction in complexity theory?
Q25easy
What is an ambiguous grammar?
Q26medium
What is the pumping length in pumping lemma for regular languages?
Q27medium
What is the difference between deterministic and non-deterministic PDA?
Q28hard
What is the Post Correspondence Problem (PCP)?
Q29easy
What is the purpose of minimization of DFA?
Q30medium