GATE CS 2021 (Forenoon) — Question 12

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

Let \(P\) be an array containing \(n\) integers. Let \(t\) be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of \(n\) elements. Which one of the following choices is correct?
  1. A
    \(t > 2n - 2\)
  2. B
    \(t > 3 \left\lceil \frac{n}{2} \right\rceil\) and \(t \leq 2n - 2\)
  3. C
    \(t > n\) and \(t \leq 3 \left\lceil \frac{n}{2} \right\rceil\)
  4. D
    \(t > \lceil \log_2(n) \rceil\) and \(t \leq n\)
Practise the full 2021-FN 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