GATE CS 2025 (Afternoon) — Question 41

AlgorithmsSearching, Sorting, Hashing MechanismsMCQ2 marks · −2/3 if wrongMedium

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 \)?
  1. A
    \( \Theta(n) \)
  2. B
    \( \Theta(1) \)
  3. C
    \( \Theta(\log^2 n) \)
  4. D
    \( \Theta(\log n) \)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
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