1
GATE CSE 2014 Set 1
Numerical
+2
-0
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 _________.
Your input ____
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let $${x_n}$$ denote the number of binary strings of length $$n$$ that contains no consecutive $$0s$$.
Which of the following recurrences does $${x_n}$$ satisfy?
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
When $$n = {2^{2k}}$$ for some $$k \ge 0$$, the recurrence relation
$$$T\left( n \right) = \sqrt 2 T\left( {n/2} \right) + \sqrt n ,\,\,T\left( 1 \right) = 1$$$
evaluates to
evaluates to
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
In how many ways can $$b$$ blue balls and $$r$$ red balls be distributed in $$n$$ distinct boxes?
Questions Asked from Combinatorics (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2023 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2008 (5)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2005 (3)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (1)
GATE CSE 1994 (1)
GATE CSE 1989 (1)
GATE CSE 1988 (1)
GATE CSE 1987 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages