GATE - Data Science and Artificial Intelligence (DA) · India · IITs and IISc on rotation (2027: IIT Madras)
Original practice questions written to the published syllabus · not past papersGATE - Data Science and Artificial Intelligence (DA) is a postgraduate admission exam run by IITs and IISc on rotation (2027: IIT Madras), for candidates in India. Computer-based, 3 hours, 100 marks (15 General Aptitude + 85 subject). MCQ, MSQ and NAT; negative marking on MCQ only.
Source: gate2027.iitm.ac.in.
Checked against the exam body's published information. Formats and fees change; confirm the current edition there before you book.
Prediction from data with honest validation: the bias-variance trade-off, regularised regression, trees and ensembles, support vector machines, neural networks and deep learning for images, unsupervised learning, and how to use them on yield, disease, price and image data without fooling yourself. The Agribusiness and Agricultural Engineering tracks introduce ML; this is the statistician's full course.
Our 104 GATE DA questions in this subject: 28 easy, 58 medium, 18 hard, across 12 units.
Choose an answer, then open the working. Each explanation says why the right answer is right and why the others are not.
These 10 were written to GATE DA and are not shown on any other exam's page.
With 3 classes and 10 predictors, how many covariance parameters must QDA estimate in total?
C. 165
Each 10 x 10 covariance matrix has p(p + 1)/2 = 55 distinct parameters, and QDA needs one per class: 3 x 55 = 165. LDA needs only 55; 300 ignores symmetry; 30 counts variances only.
For a node with 30 diseased and 70 healthy plants, what is the entropy in bits?
D. 0.881
Entropy = -(0.3 log2 0.3 + 0.7 log2 0.7) = 0.881 bits. Natural logs give 0.611 nats; 1.000 is the maximum, for a 50:50 node.
In bagging with n = 100 observations, what proportion of observations is expected to be left out of a given bootstrap sample?
C. 0.366
Each observation is missed with probability (1 - 1/100)^100 = 0.366, close to 1/e = 0.368. 0.632 is the proportion included; these out-of-bag cases give a free test-error estimate.
What is the main weakness of a single, unpruned decision tree?
A. High variance
Small changes in data can change the whole tree, so its predictions vary greatly; trees model interactions and handle categorical predictors naturally.
Which linkage in hierarchical clustering tends to produce long, straggly chains of clusters?
C. Single linkage
Single linkage merges on the closest pair, so clusters can grow by chaining; complete linkage and Ward's method produce compact clusters.
What is a medoid?
B. A real observation central to its cluster
k-medoids represents each cluster by a real case, which is robust to outliers and easy to describe.
By the eigenvalue-greater-than-one rule, how many components would be kept from a correlation-matrix PCA with eigenvalues 2.4, 1.1, 0.3 and 0.2?
A. 2
Two eigenvalues (2.4 and 1.1) exceed 1, the average eigenvalue of a correlation matrix.
A yield model's most important predictor by SHAP is the field identifier. What should the analyst suspect?
A. It memorises fixed field-level effects
Identifiers carry fixed field effects; a model relying on them will not generalise to new fields. Interpretation is a check for such artefacts.
In A* search, the frontier holds node P with g = 6 and h = 5, node Q with g = 9 and h = 1, and node R with g = 4 and h = 8. Which node is expanded next?
A. Q
A* expands the node with the lowest f = g + h: P = 11, Q = 10, R = 12, so Q. Greedy best-first would also pick Q here by h alone, but for a different reason.
How many nodes are at depth 4 of a search tree with branching factor 3?
C. 81
The number of nodes at depth d is b^d = 3^4 = 81. 121 is the total through depth 4; 64 swaps base and exponent.
This plan follows where our questions actually fall, so the time goes where the marks are likely to be. It is our reading of the syllabus, not the exam body's weighting.
Read the manual chapters for these first and do every worked question you can find on them.
Aim for one sitting per unit, then mixed questions across them.
Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.
Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.
Do these early in revision so they are fast on the day.
Last updated · How Laisha writes and checks its pages · Report a mistake
US$10 a month · one price worldwide · cancel any time
| Free | Smarter | |
|---|---|---|
| Grow guides, pest pages, articles | Read all | Read all |
| Ask Laisha | 5 a day | Up to 1,000 a month |
| Exam practice | The sample on each page | Every question, timed papers |
| Crop calendar and pest alerts | — | For your own fields |
| Calculators and tools | — | All |
| Uploads and reports | — | 100 a month, real files |
An AI operating system for agriculture: free guides, manuals and tools written for every country.