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

Questions without answers in Combinatory

0 votes
0 answers
3
Self doubt on Combinatorics Discrete Mathematics
What is the total number of integer partitions ( unordered Summation) of the natural number 8 ? I am getting 22. Is it correct ?
What is the total number of integer partitions ( unordered Summation) of the natural number 8 ?I am getting 22. Is it correct ?
User Avatar
1 votes
0 answers
6
kenneth rosen, counting, exercise: 6.5, question: 50
How many ways are there to distribute five distinguishable objects into three indistinguishable boxes?
How many ways are there to distribute five distinguishable objects into three indistinguishable boxes?
User Avatar
0 votes
0 answers
11
Unacademy AIMT 1
How many integers are there in the set {1,2,3,…..,1000} with no digit being repeated?
How many integers are there in the set {1,2,3,…..,1000} with no digit being repeated?
User Avatar
1 votes
0 answers
12
DRDO CSE 2022 Paper 1 | Question: 14
Derangements are permutations $\pi$ of the set $\{1,2, \ldots, n\}$ such that $\pi(i) \neq i.$ Compute the number of derangements on the set $1,2, \ldots, n$.
Derangements are permutations $\pi$ of the set $\{1,2, \ldots, n\}$ such that $\pi(i) \neq i.$ Compute the number of derangements on the set $1,2, \ldots, n$.
User Avatar
1 votes
0 answers
13
DRDO CSE 2022 Paper 1 | Question: 16
Let us say we have a supply of $1$ rupee and $2$ rupee coins in large quantities. What is the generating function for the number of ways of giving change with $1$ rupee and $2$ rupee coins.
Let us say we have a supply of $1$ rupee and $2$ rupee coins in large quantities. What is the generating function for the number of ways of giving change with $1$ rupee a...
User Avatar
0 votes
0 answers
14
Engineering Mathematics
Can somebody brief description about this topic(means formula or link to study). Actually this question is asked in TOC test, but looking more like mathematics part.
Can somebody brief description about this topic(means formula or link to study).Actually this question is asked in TOC test, but looking more like mathematics part.
User Avatar
6 votes
0 answers
15
Combinatorics : Distinct objects and Distinct boxes
How many ways are there to Distribute 7 distinct objects to 3 Distinct boxes and No box should be Empty Any box can be Empty
How many ways are there to Distribute 7 distinct objects to 3 Distinct boxes andNo box should be EmptyAny box can be Empty
User Avatar
0 votes
0 answers
16
Mathematics for Natural Science
Let y in the form of $a + bi$, where $a$ and $b$ are real numbers, be the cubic roots of complex number $z^{20},$ where $z=\frac{2}{4 + 3i}.$ Find $a + b.$
Let y in the form of $a + bi$, where $a$ and $b$ are real numbers, be the cubic roots of complex number $z^{20},$ where $z=\frac{2}{4 + 3i}.$ Find $a + b.$
User Avatar
0 votes
0 answers
17
Discrete Mathematics and Combinatorics
Solve the recurrence relation $a^{2}n-5a^{2}_{n-1}+4a^{2} _{n-2}=0$, if $a_{0}=4, a_{1}=13, n>1$
Solve the recurrence relation $a^{2}n-5a^{2}_{n-1}+4a^{2} _{n-2}=0$, if $a_{0}=4, a_{1}=13, n>1$
User Avatar
0 votes
0 answers
20
NIELIT Scientist B 2020 November: 118
The number of $4$ digit numbers which contain not more than two different digits is: $576$ $567$ $513$ $504$
The number of $4$ digit numbers which contain not more than two different digits is:$576$$567$$513$$504$
User Avatar
1 votes
0 answers
21
NIELIT Scientific Assistant A 2020 November: 51
Given $r_{12}=0.6, r_{13}=0.5$ and $r_{23}=0.8,$ the value of $r_{12.3}$ is : $0.47$ $0.40$ $0.74$ $0.64$
Given $r_{12}=0.6, r_{13}=0.5$ and $r_{23}=0.8,$ the value of $r_{12.3}$ is :$0.47$$0.40$$0.74$$0.64$
User Avatar
0 votes
0 answers
22
Kenneth Rosen Edition 7 Exercise 8.3 Question 6 (Page No. 535)
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$
User Avatar
0 votes
0 answers
23
Kenneth Rosen Edition 7 Exercise 8.3 Question 5 (Page No. 535)
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplication algorithm.
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplica...
User Avatar
0 votes
0 answers
25
Kenneth Rosen Edition 7 Exercise 8.3 Question 2 (Page No. 535)
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?
User Avatar
0 votes
0 answers
30
Kenneth Rosen Edition 7 Exercise 8.2 Question 49 (Page No. 527)
Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$
Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$
User Avatar
To see more, click for the full list of questions or popular tags.