1
GATE AI 2025
MCQ (Single Correct Answer)
+1
-0

The number of additions and multiplications involved in performing Gaussian elimination on any $n \times n$ upper triangular matrix is of the order

A
$O(n)$
B
$O\left(n^2\right)$
C
$O\left(n^3\right)$
D
$O\left(n^4\right)$
2
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
3
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
4
GATE AI 2025
MCQ (More than One Correct Answer)
+2
-0

Let $G$ be a simple, unweighted, and undirected graph. A subset of the vertices and edges of $G$ are shown below.

GATE AI 2025 Algorithms - Greedy Method Question 1 English It is given that $a-b-c-d$ is a shortest path between $a$ and $d ; e-f-g-h$ is a shortest path between e and $h ; a-f-c$ - $h$ is a shortest path between $a$ and $h$. Which of the following is/are NOT the edges of $G$ ?
A
$(b, d)$
B
$(b, g)$
C
$(b, h)$
D
$(e, g)$

GATE Data Science and Artificial Intelligence Papers

All year-wise previous year question papers