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}}}$$

Highest voted questions in Combinatory

30 votes
5 answers
32
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
28 votes
8 answers
34
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 ______.
28 votes
8 answers
37
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$?$i$$i+1$$2i$$2^i$
26 votes
6 answers
39
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 ___________
26 votes
5 answers
40
The number of substrings (of all lengths inclusive) that can be formed from a character string of length $n$ is$n$$n^2$$\frac{n(n-1)}{2}$$\frac{n(n+1)}{2}$
23 votes
3 answers
45
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
22 votes
1 answer
47
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is od...
21 votes
2 answers
49