Regular Expressions (Theory of Computation) MCQs
Graph Traversal MCQs 💠Graph Traversals – GATE-Level MCQs (Algorithms) Q1. Breadth-First Search (BFS) uses which data...
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...
Dynamic Programming (Algorithm Design Techniques)
💠Space Complexity — GATE-Level MCQs (Algorithms) Q1. What is the auxiliary space used by merge sort...
Asymptotic Worst-Case Time Complexity MCQs (GATE – Algorithms) Q1. If an algorithm’s running time is given by...
Hashing MCQs for GATE (with answers & solutions)
