GATE Computer Science (CS) 2015 Shift 2 Solved Paper
© examsiri.com
Question : 16 of 65
Marks:
+1,
-0
An unordered list contains n distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is
Go to Question: