46 Qs · since 2011 · 71 marks · 2.7 marks/paperHigh yield
Probability and Statistics in GATE CS is consistently tested with 2 to 4 questions per year, spanning fundamental combinatorics, conditional probability, Bayes' theorem, discrete a… Guide
Topic guide
Probability and Statistics in GATE CS is consistently tested with 2 to 4 questions per year, spanning fundamental combinatorics, conditional probability, Bayes' theorem, discrete and continuous random variables, and expectation/variance properties. A notable proportion of questions require setting up a discrete probability model (urn/coin/dice experiments or bit strings) or computing expectations using linearity of expectation and integration over piece-wise uniform intervals. The question mix favors NAT and conceptual MCQ/MSQ formats with an emphasis on exact algebraic reasoning rather than heavy numerical statistical testing.
Bayes' Theorem and Conditional Probability Updates
common · NAT · 2 marks · 2025, 2021, 2017, 2016
Scenarios involving two or more sources/states (e.g., faulty coins, binary signal transmission through noisy channels, disease/job tests) where an observed signal/result requires computing the posterior probability of the underlying cause.
Linearity of Expectation and Indicator Variables
common · mixed · 1.5 marks · 2026, 2021, 2017, 2014
Computing the expected number of structures (e.g., triangles/cycles in random graphs, matching bins, word lengths, or game strategies) using the sum of expectations of indicator variables.
Continuous Distribution Normalization and Moment Integrals
common · NAT · 1.5 marks · 2025, 2021, 2016, 2014
Given a PDF with an unknown constant or boundary over an interval (polynomial, uniform, or exponential), finding the constant by setting the integral to 1, or computing subinterval probabilities and expected lengths of sub-segments.
Sequential Urn / Coin / Dice Trials with Conditional Stopping
common · mixed · 2 marks · 2026, 2024, 2021, 2018
Multi-stage drawing with/without replacement, Pólya urn processes, coin toss sequences with overlapping condition events, or repeating until non-tie scenarios.
Distribution Identification and Parameter Properties
occasional · mixed · 1 marks · 2026, 2021, 2017, 2013
Recognizing standard distributions (Poisson, Binomial, Normal, Exponential) from their PMF/PDF or PGF, and computing mean, variance, or standard deviation directly from algebraic parameters.
Set-Theoretic Probability and Inclusion-Exclusion
occasional · MSQ · 1.5 marks · 2024, 2023, 2014
Determining union, intersection, and complement probabilities or divisibility counts over finite sets using the Principle of Inclusion-Exclusion and event independence definitions.
Conditional Probability with Reduced Sample Space
occasional · MCQ · 1 marks · 2011
A random experiment (e.g., multiple fair coin tosses) is conducted with partial outcome information provided as a conditioning event (e.g., 'at least one head'). The candidate must evaluate the posterior probability of a specific joint outcome given the conditioned sample space.
Recursive Probabilistic Experiment / First-Step Conditioning
rare · NAT · 2 marks · 2016
An experiment with distinct stopping and loopback conditions defined across coin tosses or dice rolls, requiring the determination of the eventual probability of reaching a particular outcome state.
Evaluation of Cumulative Distribution Function (CDF)
rare · MCQ · 1 marks · 2012
Given a discrete random variable with specified outcomes and probabilities, determine the values of its CDF at specific points.
Sum Distribution of Discrete Uniform Random Variables
rare · NAT · 2 marks · 2014
Finding the probability or number of favorable outcomes for the sum of independent discrete random variables (e.g., fair six-sided dice) equaling a specific target value.
Bayes' Theorem
Used when computing posterior probabilities given an observed condition across mutually exclusive causes.
Variance and Second Moment Relation
Used to compute variance or second moments, especially for Poisson, Binomial, and discrete linear transformations.
Linearity of Expectation
Used for expected counts (triangles in random graphs, word lengths, multi-step exam rewards) regardless of independence.
PDF Normalization and Interval Probability
Used to evaluate unknown parameters in continuous probability density functions and calculate slice probabilities.
Binomial Variance & Standard Deviation
Used when computing the spread/standard deviation of independent Bernoulli trial counts.
Cauchy-Schwarz Inequality for Random Variables
Used to evaluate the validity of theoretical statements bounding covariance and correlation.
Poisson Distribution PMF and Variance
Used to find probabilities of rare event counts and expectations involving shifted quadratic terms.
Gaussian (Normal) PDF Form
Used to match standard Gaussian parameters from an exponential-quadratic density equation.
Conditional Probability Definition
Used to find the probability of event occurring given that event has already occurred, especially when all elementary outcomes in sample space are equally likely.
Law of Total Probability (First-Step Analysis)
Used to set up a linear equation for the overall success probability when an experiment can restart identically from the initial state.
Sum of Infinite Geometric Series for Repeated Trials
Used to compute total probability over indefinitely repeated independent trials.
Cumulative Distribution Function (CDF)
Used to compute cumulative probabilities up to a given real value for a discrete random variable.
Stars and Bars (Non-negative Integer Solutions)
Used to find the number of ways to distribute a sum across non-negative integer variables .
Symmetry of Dice Sums
Used to simplify counting the number of ways to achieve a large sum with fair -sided dice by reflecting it about the mean.
Dice Transformation for Upper Bounds
Used to shift bounded dice variables into non-negative integers summing to a small number.
Shift from simple standard MCQ formulas towards NAT and multi-select MSQs testing precise definitions of independence, mutual exclusivity, and covariance bounds.
2024, 2023, 2021, 2015, 2014
Introduction of geometric/continuous piecewise random variables (such as stick-breaking, subinterval containment, and median of rectified Gaussian variables).
2025, 2017, 2014
Growing use of CS-specific applications including bit transmission over noisy channels, parity of random binary vectors, and random graph substructures.
2025, 2021, 2020, 2019, 2015, 2013
Direct, single-step sample space reduction and conditional probability testing was posed as a foundational 1-mark MCQ in earlier GATE exams.
2011
Appeared as a 2-mark NAT question testing recursive probability and law of total probability modeled via an algorithmic sequence of coin flips.
2016
Appeared as a direct, foundational 1-mark multiple choice question evaluating definition-level knowledge of CDFs.
2012
In 2014, discrete probability was tested via a 2-mark NAT problem requiring combinatorial variable transformation rather than straightforward brute-force enumeration.
2014
Easy questions (1 mark) typically involve direct plug-and-chug into distribution formulas (Binomial variance, Poisson mass function, Gaussian PDF parameter identification) or basic 2-event set formulas. Medium questions (2 marks) require conditioning on intermediate random variables (e.g., common toss outcome in coin sequences, multi-stage Pólya urn analysis), piecewise definite integrals for continuous expectations, or applying Bayes' theorem to transition diagrams.