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)
Sorting Algorithms— GATE-Level MCQs Q1. Which of the following sorting algorithms has the best average-case time complexity?A)...
Graphs MCQs with Solutions 1. A graph with n vertices and n−1 edges, with all vertices connected,...
Binary Heaps MCQs with Solutions 1. A max-heap is a complete binary tree in which:A. Parent is...
