LAISHA
Open Laisha

GATE - Data Science and Artificial Intelligence (DA)

India · IITs and IISc on rotation (2027: IIT Madras)

291practice questions written to this syllabus
18subjects

What GATE is

GATE (Graduate Aptitude Test in Engineering) is a national-level test conducted by IISc and the IITs on behalf of the National Coordination Board, Ministry of Education, India; IIT Madras organises GATE 2027. Data Science and Artificial Intelligence (DA) is one of its 30 papers. A valid GATE score is used for Master's and direct Doctoral admission, with possible financial assistance, at Ministry of Education-supported institutions, and some public sector undertakings use scores for recruitment. Qualifying does not guarantee admission, a scholarship or a job.

Who is eligible

How to register

  1. Registration, the application window and the fee are the same for every GATE paper, including DA: apply on the GATE 2027 portal run by IIT Madras (the steps are listed in our GATE AG guide at /degrees/agri-engineering/exams/gate-ag).

Format

DA paper: 15 marks General Aptitude + 85 marks subject questions (the DA paper has no separate Engineering Mathematics block), 180 minutes. GATE 2027 is computer-based, in English, 3 hours, 65 questions (10 General Aptitude + 55 subject), 100 marks; questions carry 1 or 2 marks. Question types are MCQ, MSQ and NAT. A wrong MCQ answer deducts 1/3 mark (1-mark question) or 2/3 mark (2-mark question); MSQ and NAT have no negative marking and MSQ has no partial marking.

From the exam body's own pages, checked 2026-11-08.

Sections

Fees: GATE 2027 application fee per the official fee page: Female/SC/ST/PwD candidates 1,000 (one paper) or 2,000 (two papers) in the regular period, 1,500 or 2,500 in the extended period; all other candidates including foreign nationals 2,000 or 4,000 in the regular period, 2,500 or 4,500 in the extended period. The page does not print a currency symbol.

How it has changed

Relevant to agricultural data-science MTech/PhD admission and to Computer Application candidates. Sections read from the 2026 syllabus; the 2027 syllabus lists the same topics.

How it differs from similar exams

Unlike most engineering papers such as AG, CE or ME, where 13 of the 85 subject marks are Engineering Mathematics, the DA paper's 85 subject marks have no separate Engineering Mathematics block. DA can be paired as a second paper with CS, EC, EE, MA, ME, PH, RA, ST or XE.

How to prepare for GATE

Where our 291 questions for it fall

Our reading of the syllabus, from the questions we have written to this exam; the exam body's own weighting, where published, is under Format above.

  1. Heaviest (79% of the questions): Statistical & Machine Learning for Agriculture (104); Exploratory Data Analysis & Statistical Graphics (54); Databases, Big Data & Agricultural Information Systems (22); Statistical Computing: Simulation, Resampling & Algorithms (20); Programming for Statistics & Data (R and Python) (18); Linear Algebra & Matrix Theory for Statistics (12).

    Start here: read these subjects' manuals first and work their questions until the reasoning is automatic.

  2. Middle band: Computer Science Fundamentals: Architecture, Data Structures, Networks & Operating Systems (10); Linear Models & Regression Analysis (10); Spatial Statistics, Geostatistics & Remote Sensing for Agriculture (10); Multivariate Analysis (7); Categorical Data Analysis & Generalized Linear Models (5); Bayesian Inference (5).

    One pass per subject, then mixed sets across them.

  3. Lighter: Probability Theory (4); Statistical Inference II: Testing of Hypotheses & Sequential Analysis (3); Optimization Techniques for Statisticians (3); Stochastic Processes (2); Probability Distributions & Sampling Distributions (1); Bioassay, Survival & Epidemiological Statistics (1).

    Definitions, classifications and standard figures; quick to revise, easy marks to lose.

  4. Hardest share: Statistical Inference II: Testing of Hypotheses & Sequential Analysis (1 hard of 3), Linear Models & Regression Analysis (3 hard of 10), Exploratory Data Analysis & Statistical Graphics (13 hard of 54).

    Leave untimed time for these and read every explanation, including for the options you rejected.

Official sources: GATE 2027 official website (IIT Madras) · Eligibility criteria · Application fees · Question paper pattern · Important dates · Two-paper combinations · GOAPS application portal · GATE 2027 DA syllabus (PDF). Checked 2026-11-08.

Not confirmed from an official source, so not stated here: Exact admit-card release date (listed as TBA on the official important-dates page when checked).; Whether an on-screen virtual calculator is provided: the GATE 2027 question-paper-pattern page fetched did not mention it.; Which of several listed registration dates applied (the important-dates table shows original and revised dates together); registration was shown as closed on the home page.; Year the DA paper was introduced (entry says GATE 2024): not stated on the GATE 2027 pages fetched.; Relevance to agricultural data-science admissions: not stated on any official page fetched..

8 practice questions, worked

Original questions written to this exam's published syllabus and pattern. Not past papers.

1. Which approach gives a likelihood-based choice of the number of clusters and membership probabilities?

  1. Classical multidimensional scaling
  2. Normal-mixture model-based clustering
  3. Single-linkage clustering
  4. k-means with one random start
Answer and working

B. Normal-mixture model-based clustering

Fitting mixtures of multivariate normals by EM allows comparison of numbers of components by BIC and gives posterior membership probabilities.

Multivariate Analysis · Cluster analysis: hierarchical and k-means

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

Statistical & Machine Learning for Agriculture · Decision trees, random forests and gradient boosting

3. In a sample of 5 observations, what is the largest possible absolute z-score, (x − x̄)/s, using s with divisor n − 1?

  1. 3.00
  2. 1.79
  3. 2.24
  4. 1.96
Answer and working

B. 1.79

The bound is (n − 1)/√n = 4/√5 = 1.79. So in small samples a |z| > 3 rule can never flag anything: an extreme value inflates the s that defines its own z (masking). 2.24 is √5.

Exploratory Data Analysis & Statistical Graphics · Outliers and influential observations

4. A sample of 1,000 plant heights has IQR 4.0 cm. What bin width does the Freedman-Diaconis rule suggest?

  1. 0.80 cm
  2. 0.40 cm
  3. 8.00 cm
  4. 1.39 cm
Answer and working

A. 0.80 cm

h = 2 IQR n^(−1/3) = 2 × 4.0 × 1000^(−1/3) = 8.0/10 = 0.80 cm. 8.00 omits the n^(−1/3) factor; 0.40 omits the factor 2.

Exploratory Data Analysis & Statistical Graphics · Histograms, density estimates and quantile-quantile plots

5. U₁, ..., U₁₂ are iid uniform on (0, 1). Why is S = ΣUᵢ − 6 used as a rough standard normal generator?

  1. S has mean 0 and variance 12 × 1/12 = 1, and the CLT makes it near-normal
  2. S is exactly normal because a sum of uniforms is always normally distributed
  3. S has mean 6 and variance 1, and the normal shape follows from symmetry alone
  4. S has mean 0 and variance 12, and dividing is unnecessary for large sums
Answer and working

A. S has mean 0 and variance 12 × 1/12 = 1, and the CLT makes it near-normal

Each Uᵢ has mean 1/2 and variance 1/12, so ΣUᵢ has mean 6 and variance 1; subtracting 6 standardises it, and the CLT makes 12 terms close to normal (though the tails are cut off at ±6). A sum of uniforms is never exactly normal.

Probability Theory · Central limit theorems (Lindeberg-Levy, Liapounov) and the delta method

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

Statistical & Machine Learning for Agriculture · Artificial intelligence: search, logic and reasoning under uncertainty

7. When is a table preferable to a graph?

  1. When the main message is a trend over time
  2. When comparing the shapes of distributions
  3. When showing the relation between two continuous variables
  4. When readers need to look up exact values
Answer and working

D. When readers need to look up exact values

Tables serve look-up of precise numbers; graphs show patterns, trends, shapes and relations better. Many reports pair a graph for the message with a table for the record.

Exploratory Data Analysis & Statistical Graphics · Tables for reports and publications

8. Diseased and healthy plants are to be classified from reflectance at several wavelengths plus a categorical cultivar code. Which method avoids assuming multivariate normal predictors?

  1. Logistic regression
  2. Factor analysis
  3. Fisher's LDA with pooled S
  4. Hotelling's T²
Answer and working

A. Logistic regression

Logistic regression models P(diseased | x) directly and handles categorical predictors; LDA is more efficient when normality holds but is sensitive when it does not.

Multivariate Analysis · Discriminant analysis and classification

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 all 291 questions — GATE - Data Science and Artificial Intelligence (DA)

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

  • Every practice question for this course, with explanations
  • Timed papers for the exams this course leads to
  • Ask Laisha to explain any topic — 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.