Loading previous year questions
Algorithms · Searching
Official IIT answer key · IIT Guwahati · Audited Aug 2026
GATE CSE 2025 Set 2 Q20 · MCQ · 1 mark
Key concept
No account needed
Sit 1 related SearchingPYQs 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
In this topic, GATE evaluates the fundamental understanding of comparison-based bounds and logical deduction on unordered lists. Rather than standard search algorithms (linear/binary search), questions test the exact minimum number of comparisons needed to satisfy non-standard or relaxed selection conditions.
Full Searching guide →Consider an unordered list of N distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?
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.