GATE Data Science & AI
130 questions · 3 years · 13 subjects
Public preview: use this branch page to find high-signal topics and keyed questions. Explanations are being added selectively, starting with recent and recurring concepts.
Subjects
By Year
High-yield topics
All trends →Linear Algebra - Matrices
2 Qs · 1 years
2026-2026 · 0% hard
Machine Learning - Regression
2 Qs · 1 years
2026-2026 · 50% hard
Probability and Statistics - Distributions
2 Qs · 1 years
2026-2026 · 0% hard
Discrete Mathematics - Logic
2 Qs · 1 years
2026-2026 · 50% hard
Programming - Python
2 Qs · 1 years
2026-2026 · 50% hard
Calculus - Limits and Series
1 Qs · 1 years
2026-2026 · 0% hard
Calculus - Functions, Roots, Maxima/Minima
1 Qs · 1 years
2026-2026 · 0% hard
Algorithms - Sorting - Quick Sort
1 Qs · 1 years
2026-2026 · 0% hard
Data Structures - Trees
1 Qs · 1 years
2026-2026 · 0% hard
Data Structures - B+ Trees
1 Qs · 1 years
2026-2026 · 0% hard
Data Warehousing and Data Mining
1 Qs · 1 years
2026-2026 · 0% hard
Data Warehousing and OLAP
1 Qs · 1 years
2026-2026 · 0% hard
Practice Data Science & AI PYQs
3 questions shown in Algorithms. Filter for cleaner practice sessions.
Showing Algorithms PYQs from Data Science & AI.
2025 PYQ
The number of additions and multiplications involved in performing Gaussian elimination on any $n \times n$ upper triangular matrix is of the order
Algorithms/MCQ/answer key/explanation
2025 PYQ
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$.
Algorithms/MCQM/answer key/explanation
2025 PYQ
For which of the following inputs does binary search take time $O(\log n)$ in the worst case?
Algorithms/MCQM/answer key/explanation