GateAI
Combinatorics

GATE CSE 2014 Set 1 · Q49

NAT2 marksMedium

Time

A pennant is a sequence of numbers, each number being 1 or 2. An nn-pennant is a sequence of numbers with sum equal to nn. For example, (1,1,2)(1,1,2) is a 4-pennant. The set of all possible 1-pennants is {(1)}\{(1)\}, the set of all possible 2-pennants is {(2),(1,1)}\{(2), (1,1)\}and the set of all 3-pennants is {(2,1),(1,1,1),(1,2)}\{(2,1), (1,1,1), (1,2)\}. Note that the pennant (1,2)(1,2) is not the same as the pennant (2,1)(2,1). The number of 10-pennants is ________.

Your answerNumerical answer

Enter a value to check

Solution

Step-by-step verified solution

Official answer: 89 (±0.1) (±0.1)

Combinatorics

Let P(n)P(n) denote the number of nn-pennants.

An nn-pennant can start with either:

  1. A 11, followed by any (n−1)(n-1)-pennant, which gives P(n−1)P(n-1) possibilities.

  2. A 22, followed by any (n−2)(n-2)-pennant, which gives P(n−2)P(n-2) possibilities.

This yields the recurrence relation:

P(n)=P(n−1)+P(n−2)for n≥3P(n) = P(n-1) + P(n-2) \quad \text{for } n \ge 3

Given the base cases:

  • P(1)=1P(1) = 1

  • P(2)=2P(2) = 2

Computing the values successively:

  • P(3)=1+2=3P(3) = 1 + 2 = 3

  • P(4)=2+3=5P(4) = 2 + 3 = 5

  • P(5)=3+5=8P(5) = 3 + 5 = 8

  • P(6)=5+8=13P(6) = 5 + 8 = 13

  • P(7)=8+13=21P(7) = 8 + 13 = 21

  • P(8)=13+21=34P(8) = 13 + 21 = 34

  • P(9)=21+34=55P(9) = 21 + 34 = 55

  • P(10)=34+55=89P(10) = 34 + 55 = 89

Thus, the number of 10-pennants is 89.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Combinatorics previous year question is Q49 of the GATE CSE 2014 Set 1 paper. Find more GATE CSE PYQs on Combinatorics in Engineering Mathematics, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Combinatorics PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Combinatorics in GATE CSE

Combinatorics has 19 GATE CSE PYQs across 15 papers from 2012 to 2025. 7 of them are 2-mark NAT questions like this one, and GATE CSE 2014 Set 1 has 2.

How GATE tests Combinatorics

More from GATE CSE 2014 Set 1

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2014 Set 1 · Q49 · NAT

A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of all possible 1-pennants is {(1)}, the set of all possible 2-pennants is {(2), (1,1)}and the set of all 3-pennants is {(2,1), (1,1,1), (1,2)}. Note that the pennant (1,2) is not the same as the pennant (2,1). The number of 10-pennants is …

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.