Gate CS-2014-1 Question Paper With Solutions

Q. 59 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 ______________.

(A) 88.9 to 89.1

Answer: (A)

Explanation:

Gate CS-2014-1 Question Paper With Solutions

Learn More:   Gate EC-2019 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here