1
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
2
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)$
3
GATE AI 2025
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements is/are correct in a Bayesian network?

A
Variable elimination is an approximate inference algorithm
B
Gibbs sampling is an exact inference algorithm
C
Variable elimination is used to determine conditional probabilities
D
Rejection sampling is an approximate inference algorithm
4
GATE AI 2025
MCQ (Single Correct Answer)
+2
-0

The state graph shows the action cost along the edges and the heuristic function $h$ associated with each state.

GATE AI 2025 Artificial Intelligence - Artificial Intelligence Question 1 EnglishSuppose A* algorithm is applied on this state graph using priority queue to store the frontier. In what sequence are the nodes expanded?

A
S,A,E,C,B,D,G
B
S,E,A,C,B,D,G
C
S,A,E,B,C,D,G
D
$S, A, B, E, C, D, G$

GATE Data Science and Artificial Intelligence Papers

All year-wise previous year question papers