GATE CS 2019 (Forenoon) — Question 47

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

There are \( n \) unsorted arrays: \( A_1, A_2, ...., A_n \). Assume that \( n \) is odd. Each of \( A_1, A_2, ...., A_n \) contains \( n \) distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of \( A_1, A_2, ...., A_n \) is
  1. A
    \( \mathcal{O}(n) \)
  2. B
    \( \mathcal{O}(n \log n) \)
  3. C
    \( \mathcal{O}(n^2) \)
  4. D
    \( \Omega(n^2 \log n) \)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
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