GATE CS 2025 (Afternoon) — Question 20

AlgorithmsSearching, Sorting, Hashing MechanismsMCQ1 mark · −1/3 if wrongEasy

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?
  1. A
    1
  2. B
    \( N - 1 \)
  3. C
    \( N \)
  4. D
    \( 2N - 1 \)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Searching, Sorting, Hashing MechanismsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group