🔬
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 4 of 5 • Questions 31-40 of 50
Q31easy
What is the closure property of regular languages under complement?
Q32medium
What is the closure property of context-free languages under complement?
Q33medium
What is the purpose of Greibach Normal Form (GNF)?
Q34medium
What is the relationship between P and NP?
Q35easy
What is an example of NP-complete problem?
Q36medium
What is the purpose of ε-closure in NFA?
Q37hard
What is the language {ww | w ∈ {0,1}*}?
Q38medium
What is the purpose of the CYK algorithm?
Q39medium
What is the difference between NP-complete and NP-hard?
Q40easy
What is the purpose of a parse tree?
...