Updated : 15 hours ago
View Complete ArticleChecked 25 September 2026. Syllabus and past-paper data are official and fixed. Formulas are standard statistics.
Probability & Statistics is Section 1 of the GATE DA syllabus and, in our question-by-question count of the three official papers, the section that carried the most marks over the three years: 15 in 2024, 19 in 2025 and 21 in 2026, out of 85 subject marks per paper (100 including General Aptitude). It also sits underneath two other sections — naive Bayes, LDA and regression in Machine Learning, and conditional independence and inference in AI — so time spent here pays twice.
From the official answer keys, classified by us. 2024: 3 MCQ, 0 MSQ, 6 NAT; 2025: 9 MCQ, 1 MSQ, 2 NAT; 2026: 4 MCQ, 3 MSQ, 6 NAT.
| 2024 | 2025 | 2026 | Section (our count) | Three years |
|---|---|---|---|---|
| 15 | 19 | 21 | Probability & Statistics | 55 |
| 20 | 14 | 14 | Programming, DS & Algorithms | 48 |
| 15 | 12 | 13 | Machine Learning | 40 |
| 7 | 11 | 18 | DBMS & Warehousing | 36 |
| 10 | 12 | 8 | Linear Algebra | 30 |
| 10 | 6 | 8 | AI (search, logic, uncertainty) | 24 |
| 8 | 11 | 3 | Calculus & Optimization | 22 |
Marks per section in the three papers, from our question-by-question classification — the basis for calling P&S the heaviest section. The method and the judgement calls are in our weightage guide.
| Block | Syllabus topics |
|---|---|
| Counting and probability | Permutations and combinations; axioms; sample space and events; independent and mutually exclusive events; marginal, conditional and joint probability; Bayes theorem |
| Descriptive statistics | Mean, median, mode, standard deviation; correlation and covariance |
| Random variables | Discrete RVs and PMFs; continuous RVs and PDFs; CDFs; conditional PDF; conditional expectation and variance |
| Distributions | Uniform, Bernoulli, binomial, Poisson, exponential, normal, standard normal, t, chi-squared |
| Inference | Central limit theorem; confidence intervals; z-test, t-test, chi-squared test |
| Paper | Question numbers |
|---|---|
| GATE 2024 | 11, 12, 34, 36, 56, 57, 58, 59 (marks to all), 65 |
| GATE 2025 | 11, 19, 20, 21, 31, 36, 39, 40, 41, 45, 54, 61 |
| GATE 2026 | 19, 20, 28, 33, 34, 44, 45, 53, 54, 57, 62, 63, 64 |
Links to all three official papers and keys are in GATE DA previous year papers. Themes that came back more than once: Bayes numericals (2024 Q58, 2025 Q31, 2026 Q57); the exponential distribution — parameter and tail (2024 Q57; 2025 Q21), memorylessness (2026 Q34) and its link to the geometric (2025 Q41); conditional expectation (2024 Q59, 2025 Q11); CDFs (2025 Q19, Q39; 2026 Q54); covariance and correlation (2024 Q65, 2026 Q63); the CLT (2025 Q40, 2026 Q45); counting (2026 Q19, Q20, Q33).
| Distribution | PMF / PDF | Mean | Variance |
|---|---|---|---|
| Bernoulli(p) | P(X=1)=p, P(X=0)=1−p | p | p(1−p) |
| Binomial(n, p) | C(n,k) pᵏ(1−p)ⁿ⁻ᵏ | np | np(1−p) |
| Poisson(λ) | e^(−λ) λᵏ / k! | λ | λ |
| Uniform(a, b) | 1/(b−a) on [a, b] | (a+b)/2 | (b−a)²/12 |
| Exponential(λ) | λe^(−λx), x ≥ 0 | 1/λ | 1/λ² |
| Normal(μ, σ²) | bell curve; Z = (X−μ)/σ | μ | σ² |
| t (ν d.f.) | heavier tails than normal | 0 (ν > 1) | ν/(ν−2) (ν > 2) |
| Chi-squared (k d.f.) | sum of k squared standard normals | k | 2k |
Two habits make these formulas pay off in the exam. Identify the distribution from the story before touching numbers — "time until the next arrival" is exponential, "number of arrivals in an hour" is Poisson, "successes in n independent trials" is binomial. And check every answer against the obvious bounds: a probability between 0 and 1, a variance that is never negative, a correlation between −1 and 1.
Each is in the style of a GATE numerical-answer question, built to use one idea from the tables above. Try each before reading the answer.
Illustrative questions written for this guide, not taken from a GATE paper.
The marks above are only the questions filed under Section 1. Probability does a lot of quiet work elsewhere in the paper, which is why its effective weight is higher than its own count.
| Other section | Syllabus topic | The probability underneath |
|---|---|---|
| Machine Learning | Naive Bayes classifier | Bayes theorem plus conditional independence of features given the class |
| Machine Learning | Linear discriminant analysis | Gaussian class-conditional densities with a shared covariance |
| Machine Learning | Logistic regression | Modelling P(y = 1 | x) and maximising likelihood |
| Machine Learning | PCA | Eigen-decomposition of the covariance matrix; variance explained |
| AI | Reasoning under uncertainty | Conditional independence, exact inference by variable elimination, approximate inference by sampling |
| DBMS & Warehousing | Data transformation | Normalisation (z-scores), discretisation, sampling |
In practice this means the order of study matters: finish conditional probability, Bayes and covariance before you start naive Bayes, LDA or PCA, and the machine-learning section becomes largely an application of what you already know rather than a new subject.
| Trap | Where it bites | Defence |
|---|---|---|
| Conditioning on the wrong event | Bayes and conditional-probability NATs | Write "given what?" in words before any formula |
| Independent vs mutually exclusive | Event-property questions | Mutually exclusive events with non-zero probability are never independent |
| PDF value read as a probability | Continuous RV questions | Probabilities of continuous RVs are areas; a PDF can exceed 1 |
| Variance of a sum without covariance | Covariance/correlation items | Add 2Cov unless independence is given |
| σ vs σ/√n | CLT and confidence intervals | The spread of a mean shrinks with √n |
| Rounding a NAT too early | Any numerical answer | Keep four figures until the last step |
Probability is best learned in short daily sets: through October, five to ten past-paper P&S questions a day — the 34 in the three official papers first — covers the section twice before November.
Practise it, don't just read it
There is no probability quiz in the library yet; use it for the linear-algebra and neural-network topics that build on this section.
The ProSyllabus GATE DA library currently has three topic quizzes: Matrix Rank and Inverse (Section 2, Linear Algebra), Backpropagation in Neural Networks (Section 6, multi-layer perceptrons) and Gradient Descent Variants (optimisation practice for Machine Learning — the syllabus names no gradient methods, though a 2026 question applied an SGD update). Each has ten questions and a worked explanation for every option. Probability, programming and DBMS have no quizzes yet — drill those from the section index of the official papers.
In our question-by-question count of the official papers it carried 15 marks in 2024, 19 in 2025 and 21 in 2026, out of 85 subject marks — the most of any section in 2025 and 2026, and 55 of 255 marks across the three years.
Topics that recurred in the official papers include Bayes theorem numericals, the exponential distribution and memorylessness, conditional expectation, CDFs, covariance and correlation, the central limit theorem and counting.
Yes. The syllabus includes confidence intervals, the z-test, the t-test and the chi-squared test, along with the central limit theorem and the t and chi-squared distributions.
Many are. Of the 34 probability and statistics questions in the 2024 to 2026 papers, 14 were numerical-answer questions, where you type the value, and 16 were MCQs, which carry negative marking.
Any standard undergraduate probability and statistics text that covers the syllabus topics listed on this page will do; what matters more is solving every probability question from the three official DA papers, which show the depth GATE expects.
official = a document published by the conducting body. reported = a news or coaching site we could not check against an original. Where sources disagree this page says so rather than picking one.