1
GATE AI 2025
MCQ (More than One Correct Answer)
+1
-0

For which of the following inputs does binary search take time $O(\log n)$ in the worst case?

A
An array of $n$ integers in any order
B
A linked list of $n$ integers in any order
C
An array of $n$ integers in increasing order
D
A linked list of $n$ integers in increasing order
2
GATE AI 2025
MCQ (More than One Correct Answer)
+1
-0
Suppose that insertion sort is applied to the array $[1,3,5,7,9,11, x, 15,13]$ and it takes exactly two swaps to sort the array. Select all possible values of $x$.
A
10
B
12
C
14
D
16

GATE Data Science and Artificial Intelligence Subjects

Browse all chapters by subject

General Aptitude
Verbal Ability Logical Reasoning Numerical Ability
Discrete Mathematics
Linear Algebra Graph Theory Mathematical Logic Probability Calculus
Artificial Intelligence
Artificial Intelligence
Machine Learning
Machine Learning
Database Management System and Warehousing
Functional Dependencies and Normalization Structured Query Language Relational Algebra
Python Programming
Python Programming
Data Structures
Hashing
Algorithms
Complexity Analysis and Asymptotic Notations Searching and Sorting Greedy Method
EXAM MAP

Browse past year questions by exam & subject

Joint Entrance Examination
JEE Main JEE Advanced MHT CET BITSAT COMEDK WB JEE KCET VITEEE AP EAPCET TS EAMCET IAT (IISER)
Medical
NEET AIIMS MHT CET (Biology)
Graduate Aptitude Test in Engineering
GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN GATE Data Science and Artificial Intelligence
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12