Regular Languages (Theory of Computation) MCQs
Regular Languages (Theory of Computation) MCQs
Continue reading
Category: IT
Pushdown Automata(Theory of Computation) MCQs
Pushdown Automata(Theory of Computation) — 100 Tricky MCQs for GATE Q1. A Pushdown Automaton (PDA) differs from a Finite Automaton
Continue reading
Context-Free Grammars(Theory of Computation) MCQs
Context-Free Grammars(Theory of Computation)
Continue reading
Finite Automata(Theory of Computation) MCQs for Gate Exam
Finite Automata Tricky GATE MCQs with Solutions Q1. Which of the following is not true for Deterministic Finite Automata (DFA)?
Continue reading
Regular Expressions(Theory of Computation) MCQs
Regular Expressions (Theory of Computation) MCQs
Continue reading
Shortest Path Algorithms MCQs For Gate Exam
Shortest Path Algorithms
Continue reading
Minimum Spanning Trees MCQs For Gate Exam
Minimum Spanning Trees
Continue reading
Graph Traversal MCQs For Gate Exam
Graph Traversal MCQs 💠 Graph Traversals – GATE-Level MCQs (Algorithms) Q1. Breadth-First Search (BFS) uses which data structure?A) Stack B) Queue C)
Continue reading
Divide & Conquer MCQs for Algorithm Design Techniques
Divide & Conquer (Algorithm Design Techniques) (Wait: correct: for a=1,b=2, n^{log_b a}=n^0=1; f(n)=n which is polynomially larger → case 3?
Continue reading
Dynamic Programming (Algorithm Design Techniques) MCQs
Dynamic Programming (Algorithm Design Techniques)
Continue reading