LAISHA
Open Laisha

GATE DA Statistical & Machine Learning for Agriculture: practice questions

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 papers
10worked here, free
104written to this exam in this subject
12syllabus units

About GATE DA

GATE - 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.

Statistical & Machine Learning for Agriculture in GATE DA

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.

10 practice questions, worked

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.

Question 1 · medium

With 3 classes and 10 predictors, how many covariance parameters must QDA estimate in total?

  1. 55
  2. 30
  3. 165
  4. 300
Answer and working

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.

Question 2 · medium

For a node with 30 diseased and 70 healthy plants, what is the entropy in bits?

  1. 0.611
  2. 1.000
  3. 0.420
  4. 0.881
Answer and working

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.

Question 3 · medium

In bagging with n = 100 observations, what proportion of observations is expected to be left out of a given bootstrap sample?

  1. 0.010
  2. 0.632
  3. 0.366
  4. 0.500
Answer and working

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.

Question 4 · easy

What is the main weakness of a single, unpruned decision tree?

  1. High variance
  2. High bias in every problem
  3. It cannot model interactions
  4. It cannot handle categorical predictors
Answer and working

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.

Question 5 · easy

Which linkage in hierarchical clustering tends to produce long, straggly chains of clusters?

  1. Average linkage
  2. Ward's method
  3. Single linkage
  4. Complete linkage
Answer and working

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.

Question 6 · easy

What is a medoid?

  1. The point midway between two cluster centres
  2. A real observation central to its cluster
  3. The arithmetic mean of a cluster
  4. The median of the first principal component
Answer and working

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.

Question 7 · medium

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?

  1. 2
  2. 1
  3. 4
  4. 3
Answer and working

A. 2

Two eigenvalues (2.4 and 1.1) exceed 1, the average eigenvalue of a correlation matrix.

Question 8 · medium

A yield model's most important predictor by SHAP is the field identifier. What should the analyst suspect?

  1. It memorises fixed field-level effects
  2. The field identifier is the true cause of yield
  3. The model is ideal for new fields
  4. SHAP values cannot be computed for identifiers
Answer and working

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.

Question 9 · medium

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?

  1. Q
  2. P
  3. The node with the smallest h, then the smallest g
  4. R
Answer and working

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.

Question 10 · medium

How many nodes are at depth 4 of a search tree with branching factor 3?

  1. 64
  2. 121
  3. 81
  4. 12
Answer and working

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.

A study plan for Statistical & Machine Learning for Agriculture in GATE DA

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.

  1. First, the heavy units (37% of the 104 questions): Artificial intelligence: search, logic and reasoning under uncertainty (10, 10%); Neural networks and deep learning; CNNs for plant and field images (10, 10%); Cross-validation: k-fold and leave-one-out; spatial and temporal blocking (9, 9%); Decision trees, random forests and gradient boosting (9, 9%).

    Read the manual chapters for these first and do every worked question you can find on them.

  2. Then the middle band: Linear and quadratic discriminant analysis and logistic classification (9, 9%); Regularised regression: ridge, lasso and elastic net (9, 9%); Dimensionality reduction: PCA and embeddings (8, 8%); k-nearest neighbours and naive Bayes (8, 8%).

    Aim for one sitting per unit, then mixed questions across them.

  3. Then the lighter units: Model interpretation: variable importance and SHAP (8, 8%); Supervised learning and the bias-variance trade-off (8, 8%); Support vector machines (8, 8%); Unsupervised learning: k-means, k-medoids and hierarchical clustering (8, 8%).

    Learn the definitions, classifications and standard numbers; these units are more often recalled than worked.

  4. Leave time for the hard ones: Regularised regression: ridge, lasso and elastic net (3 hard of 9), k-nearest neighbours and naive Bayes (2 hard of 8), Model interpretation: variable importance and SHAP (2 hard of 8).

    Come back to these after a first pass, untimed, and read every explanation, including for the options you rejected.

  5. Bank the easy marks: k-nearest neighbours and naive Bayes (3 easy of 8); Supervised learning and the bias-variance trade-off (3 easy of 8).

    Do these early in revision so they are fast on the day.

  6. Finish timed. Sit the subject as a timed set without notes, mark it, and send each wrong answer back to its unit above.

Last updated · How Laisha writes and checks its pages · Report a mistake

Ask Laisha about this

Opens Laisha's chat with your question ready to send. Sign in or start free.

Unlock every question — GATE DA Statistical & Machine Learning for Agriculture

US$10 a month · one price worldwide · cancel any time

  • Every practice question in this subject, with full working
  • Timed exam papers and progress by unit
  • Ask Laisha to explain any answer — up to 1,000 questions a month
Free or Smarter
FreeSmarter
Grow guides, pest pages, articlesRead allRead all
Ask Laisha5 a dayUp to 1,000 a month
Exam practiceThe sample on each pageEvery question, timed papers
Crop calendar and pest alerts—For your own fields
Calculators and tools—All
Uploads and reports—100 a month, real files
10 days free for every new account, no card.