The questions from the GATE 2019 Computer Science paper that are in the W3Colleges verified bank. This is a partial paper, not the full 65-question original — import the complete paper to fill it out.
Question 1
There are \(n\) unsorted arrays: \(A_1, A_2, \ldots, A_n\). Assume that \(n\) is odd. Each of \(A_1, A_2, \ldots, 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, \ldots, A_n\) is
Answers and explanations are free — they just need an account.