Register

Web Page

Syllabus: Combinatorics: Counting, Recurrence relations, Generating functions.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&1&0&0&2&1&0&0&1&0&0&0.6&2
\\\hline\textbf{2 Marks Count} & 2 &0&1&1&0&1&0&1&2&1&0&0.9&2
\\\hline\textbf{Total Marks} & 5 &1&2&2&2&3&0&2&5&2&0&2.4&5\\\hline
\end{array}}}$$

Filter

Previous GATE Questions in Combinatory

7 votes
4 answers
1
GATE CSE 2023 | Question: 5
The Lucas sequence $L_{n}$ is defined by the recurrence relation: \[ L_{n}=L_{n-1}+L_{n-2}, \quad \text { for } \quad n \geq 3, \] with $L_{1}=1$ and $L_{2}=3$ ... $L_{n}=\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}$
The Lucas sequence $L_{n}$ is defined by the recurrence relation:\[L_{n}=L_{n-1}+L_{n-2}, \quad \text { for } \quad n \geq 3,\]with $L_{1}=1$ and $L_{2}=3$.Which one of t...
User Avatar
17 votes
3 answers
5
GATE CSE 2022 | Question: 22
The number of arrangements of six identical balls in three identical bins is _____________ .
The number of arrangements of six identical balls in three identical bins is _____________ .
User Avatar
26 votes
6 answers
8
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
User Avatar
28 votes
8 answers
10
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
User Avatar
19 votes
18 answers
12
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
The value of $3^{51} \text{ mod } 5$ is _____
User Avatar
42 votes
11 answers
13
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...
User Avatar
58 votes
9 answers
14
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
User Avatar
37 votes
5 answers
15
GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
User Avatar
12 votes
2 answers
16
GATE CSE 1990 | Question: 3-ix
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is: $15!/(5!)^{3}$ $15!$ $\left(\frac{15}{5}\right)$ $15!(5!3!)$.
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is:$15!/(5!)^{3}$$15!$$\left(\frac{15}{5}\right)$$15!(5!3!)$.
User Avatar
36 votes
8 answers
18
GATE CSE 1987 | Question: 10b
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
User Avatar
67 votes
10 answers
20
GATE CSE 2016 Set 1 | Question: 27
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
User Avatar
To see more, click for the full list of questions or popular tags.