chapter
    Urn Models and Reinforcement Processes PYQs for GATE CS

    Solve 2+ Urn Models and Reinforcement Processes previous year questions for GATE CS with answers and detailed solutions. Free sample questions below.

    Try a question

    Answer it here to see how it works. Nothing is recorded until you sign in.

    Question 1
    2026 Slot Set1 PYQ
    Level 3: Exam Standard

    An urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put back in the urn. The probability that there are equal number of red and blue balls after two steps is

    Question 2
    2021 Slot Set2 PYQ
    Level 3: Exam Standard

    A bag has red balls and black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and the ball is placed back into the bag along with another ball of the same colour. Note that the number of balls in the bag will increase by one, after the trial. A sequence of four such trials is conducted. Which one of the following choices gives the probability of drawing a red ball in the fourth trial?

    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    Urn Models and Reinforcement Processes PYQs for GATE CS

    Solve 2+ Urn Models and Reinforcement Processes previous year questions for GATE CS with answers and detailed solutions. Free sample questions below.

    Chapter Roadmap: Urn Models and Reinforcement Processes

    Your Journey Through Urn Models

    Current Focus: Polya Urn Reinforcement Processes
    • The reinforcement mechanism and state evolution
    • Exchangeability and why order does not matter
    • Computing probabilities at any step
    • Connection to Beta-Binomial distributions
    • Martingale properties and convergence

    Why This Matters for GATE

    Polya Urn models test your understanding of conditional probability in sequential processes, the difference between independent and dependent events, and the long-term behavior of stochastic systems. Master the pattern, and you will recognize it instantly.

    The Polya Urn: Rich Get Richer

    The Polya Urn: Rich Get Richer

    Start with red and black balls. At each step, draw one ball, note its color, and return it plus one additional ball of the same color.

    If Red Drawn If Black Drawn
    Red: Black:
    Total: Total:

    Key Insight: Early outcomes get amplified. This is not independent trials — each draw changes the composition of the urn.

    Urn Models and Reinforcement Processes: Solved Questions with Step-by-Step Explanations (2 Problems)

    Question 1 · Engineering Mathematics · 2026_Set1 MCQ

    An urn contains one red ball and one blue ball. At each step, a ball is picked uniformly at random from the urn, and this ball together with another ball of the same color is put back in the urn. The probability that there are equal number of red and blue balls after two steps is

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    B

    Step-by-Step Solution

    Insight: Equal red and blue after 2 steps means exactly 1 red and 1 blue were drawn — use exchangeability or direct enumeration.

    Exam route: Start: 1R, 1B. After 2 steps, total = 4. Equal counts need 2R and 2B, so exactly red drawn. By exchangeability: . Select B.

    Learning route:

    This is a Polya Urn state question, identifiable by the reinforcement mechanism (draw, replace, add one of the same colour) and the question asking about the urn's composition after a fixed number of steps.

    Setup: Initial state: 1 red, 1 blue, total 2. After 2 draws, total = balls. For equal red and blue counts, we need 2 red and 2 blue, which means exactly 1 red and 1 blue were drawn in the 2 draws.

    Method 1 — Direct enumeration:

    List all possible sequences of 2 draws:

    • RR: → final: 3R, 1B (not equal)
    • RB: → final: 2R, 2B (equal ✓)
    • BR: → final: 2R, 2B (equal ✓)
    • BB: → final: 1R, 3B (not equal)

    Method 2 — Exchangeability formula:

    With :

    Wrong path walkthrough: A student who treats draws as independent coin flips computes , matching option C. The mistake is at the independence assumption: in a Polya Urn, the second draw's probability depends on the first draw's outcome. The reinforcement mechanism makes draws dependent, reducing the probability of mixed outcomes.

    Generalisation: In a Polya Urn, reinforcement amplifies early outcomes, making "all same colour" more likely and "mixed" less likely compared to independent draws.

    Verification: The four sequence probabilities sum to . ✓

    Answer: B)

    Question 2 · Engineering Mathematics · 2021_Set2 MCQ

    A bag has red balls and black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and the ball is placed back into the bag along with another ball of the same colour. Note that the number of balls in the bag will increase by one, after the trial. A sequence of four such trials is conducted. Which one of the following choices gives the probability of drawing a red ball in the fourth trial?

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    A

    Step-by-Step Solution

    Insight: This is a Polya Urn martingale question — the probability of drawing red at any step equals the initial proportion .

    Exam route: Recognise the Polya Urn mechanism (draw, replace, add one of the same colour). By the martingale property, for every . Select option A immediately.

    Learning route:

    This is a Polya Urn reinforcement process question, identifiable because each draw reinforces the drawn colour by adding one extra ball of that colour.

    The key property is the martingale property: let be the proportion of red balls after draws, where is the number of reds drawn. Then . The expected proportion never changes.

    Since , and the expectation is preserved at every step, the unconditional probability of drawing red at step is:

    Alternatively, by exchangeability, the joint distribution of draws is symmetric under permutation, so .

    Wrong path walkthrough: A student who does not know the martingale property might try option D, computing . This is — the probability of drawing red on all four draws — not the marginal probability at step 4. The mistake breaks at the first multiplication: multiplying conditional probabilities gives the joint, not the marginal.

    Generalisation: In any Polya Urn, the marginal probability of drawing a specific colour at any single step equals its initial proportion, regardless of the step number.

    Verification: Set . By enumeration over all weighted paths, . ✓

    Answer: A)

    More previous year questions (pyqs) in this unit