Pumping Lemma (for both Regular and Context-Free Languages) Q1.Consider the language L = { aⁿbⁿ | n...
Context-Free Languages (Theory of Computation) MCQs Note: these questions assume the usual alphabets (like Σ = {a,b,c}...
Regular Languages (Theory of Computation) MCQs
Pushdown Automata(Theory of Computation) — 100 Tricky MCQs for GATE Q1. A Pushdown Automaton (PDA) differs from...
Context-Free Grammars(Theory of Computation)
Finite Automata Tricky GATE MCQs with Solutions Q1. Which of the following is not true for Deterministic...
Regular Expressions (Theory of Computation) MCQs
Graph Traversal MCQs 💠 Graph Traversals – GATE-Level MCQs (Algorithms) Q1. Breadth-First Search (BFS) uses which data...
