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
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?
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$.
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.
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$ ?
Paper Analysis
Total Questions
Algorithms 4
Artificial Intelligence 2
Data Structures 1
Database Management System and Warehousing 7
Discrete Mathematics 25
Machine Learning 12
Python Programming 4
General Aptitude 10
More Papers of GATE Data Science and Artificial Intelligence
GATE Data Science and Artificial Intelligence Papers
All year-wise previous year question papers
2025