🔬
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 1 of 5 • Questions 1-10 of 50
Q1easy
What is the main difference between DFA and NFA?
Q2easy
What type of language does a Finite Automaton recognize?
Q3medium
What is the pumping lemma used for?
Q4easy
What type of language does a Pushdown Automaton recognize?
Q5easy
What is the most powerful computational model?
Q6easy
What is the Chomsky hierarchy order (weakest to strongest)?
Q7easy
What is a regular expression for all binary strings?
Q8easy
What is the purpose of ε-transitions in NFA?
Q9medium
What is the halting problem?
Q10easy
What is the complexity class P?
...