Algorithms · Searching, Sorting and Hashing
Official IIT answer key · IIT Guwahati · Audited Aug 2026
GATE CSE 2025 Set 2 Q41 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related Searching, Sorting and HashingPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across GATE CS exams, Searching, Sorting, and Hashing are tested with a strong emphasis on exact comparison/swap counts, worst/best-case edge cases (especially for Quicksort and simultaneous min-max finding), trace-based simulation (such as step-by-step hashing probes and merge passes), and asymptotic tradeoffs for specialized or composite data inputs. Questions range from conceptual 1-mark classification to rigorous 2-mark NATs requiring precise manual execution of collision resolution or optimal merge trees.
Full Searching, Sorting and Hashing guide →An array A of length n with distinct elements is said to be bitonic if there is an index 1 i n such that A[1 i] is sorted in the non-decreasing order and A[i + 1 n] is sorted in the non-increasing order. Which ONE of the following represents the best possible asymptotic bound for the worst-case number of comparisons by an algorithm that searches for an element in a bitonic array A?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
