Crack
GATE
C
G
Topic
Combinatorics
Engineering Mathematics
0
/ 22 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
3
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
2
0.7
0
1.3
2018
0
0
0
0
2019
2
2
0
0
2020
1
0
0
1
2021
1
0
0
1
2022
3
1
1
1
2023
2
2
0
0
2024
1.5
1
0
0.5
2025
1
0.5
0
0.5
2026
0.5
0.5
0
0
1
CS 2026 Set 1 · 1 mark · MCQ · Moderate
Consider the following recurrence relations:
2
CS 2025 Set 1 · 1 mark · MCQ · Moderate
Consider the following recurrence relation.
3
CS 2025 Set 1 · 1 mark · NAT · Easy
Let
S
S
S
be the set of all ternary strings defined over the alphabet
{
a
,
b
,
c
}
\{a, b, c\}
{
a
,
b
,
c
}
. Consider all strings in
S
S
S
that contain at least one occurrence of two consecutive symbols, that is, “aa”, “bb” or “cc”. The number of such strings of length
5
5
5
that are possible is ____. (Answer in integer)
4
CS 2024 Set 1 · 1 mark · NAT · Easy
The number of spanning trees in a complete graph of
4
4
4
vertices labelled A, B, C, and D is \____
5
CS 2024 Set 2 · 1 mark · MCQ · Moderate
Let
T
(
n
)
T(n)
T
(
n
)
be the recurrence relation defined as follows:
6
CS 2024 Set 2 · 1 mark · MCQ · Easy
When six unbiased dice are rolled simultaneously, the probability of getting all distinct numbers (i.e., 1, 2, 3, 4, 5, and 6) is
7
CS 2023 · 1 mark · MCQ · Moderate
The Lucas sequence
L
n
L_n
L
n
is defined by the recurrence relation:\n\n
L
n
=
L
n
−
1
+
L
n
−
2
,
for
n
≥
3.
L_n = L_{n-1} + L_{n-2}, \qquad \text{for } n \geq 3.
L
n
=
L
n
−
1
+
L
n
−
2
,
for
n
≥
3.
\n\nwith
L
1
=
1
L_1 = 1
L
1
=
1
and
L
2
=
3
L_2 = 3
L
2
=
3
.\n\nWhich one of the options given is TRUE?
8
CS 2023 · 2 marks · MCQ · Moderate
Let
U
=
{
1
,
2
,
…
,
n
}
U=\{1,2,\ldots,n\}
U
=
{
1
,
2
,
…
,
n
}
, where
n
n
n
is a large positive integer greater than
1000
1000
1000
. Let
k
k
k
be a positive integer less than
n
n
n
. Let
A
,
B
A,B
A
,
B
be subsets of
U
U
U
with
∣
A
∣
=
∣
B
∣
=
k
|A|=|B|=k
∣
A
∣
=
∣
B
∣
=
k
and
A
∩
B
=
∅
A\cap B=\emptyset
A
∩
B
=
∅
. We say that a permutation of
U
U
U
separates
A
A
A
from
B
B
B
if one of the following is true.
9
CS 2022 · 1 mark · NAT · Moderate
The number of arrangements of six identical balls in three identical bins is ____.
10
CS 2022 · 2 marks · MCQ · Hard
Which one of the following is the closed form for the generating function of the sequence
{
a
n
}
n
≥
0
\{a_n\}_{n\ge 0}
{
a
n
}
n
≥
0
defined below?
11
CS 2022 · 2 marks · MSQ · Moderate
Consider the following recurrence:
12
CS 2021 Set 1 · 1 mark · NAT · Moderate
There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:
13
CS 2021 Set 2 · 2 marks · NAT · Easy
Let
S
S
S
be a set consisting of 10 elements. The number of tuples of the form
(
A
,
B
)
(A, B)
(
A
,
B
)
such that
A
A
A
and
B
B
B
are subsets of
S
S
S
, and
A
⊆
B
A \subseteq B
A
⊆
B
is ____.
14
CS 2020 · 2 marks · NAT · Hard
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 ____.
15
CS 2019 · 1 mark · MCQ · Moderate
Let
U
=
{
1
,
2
,
…
,
n
}
U = \{1, 2, \dots, n\}
U
=
{
1
,
2
,
…
,
n
}
. Let
A
=
{
(
x
,
X
)
∣
x
∈
X
,
X
⊆
U
}
A = \{(x, X) \mid x \in X, X \subseteq U\}
A
=
{(
x
,
X
)
∣
x
∈
X
,
X
⊆
U
}
. Consider the following two statements on
∣
A
∣
|A|
∣
A
∣
.
I.
∣
A
∣
=
n
2
n
−
1
|A| = n2^{n-1}
∣
A
∣
=
n
2
n
−
1
II.
∣
A
∣
=
∑
k
=
1
n
k
(
n
k
)
|A| = \sum_{k=1}^n k \binom{n}{k}
∣
A
∣
=
∑
k
=
1
n
k
(
k
n
)
16
CS 2019 · 1 mark · MCQ · Moderate
Let
G
G
G
be an undirected complete graph on
n
n
n
vertices, where
n
>
2
n > 2
n
>
2
. Then, the number of different Hamiltonian cycles in
G
G
G
is equal to
17
CS 2015 Set 1 · 1 mark · MCQ · Easy
Suppose that everyone in a group of
N
N
N
people wants to communicate secretly with the
N
−
1
N-1
N
−
1
others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is
18
CS 2015 Set 1 · 2 marks · MCQ · Moderate
Let
a
n
a_n
a
n
represent the number of bit strings of length
n
n
n
containing two consecutive
1
s
1\text{s}
1
s
. What is the recurrence relation for
a
n
a_n
a
n
?
19
CS 2015 Set 2 · 1 mark · NAT · Easy
The number of divisors of
2100
2100
2100
is _____.
20
CS 2015 Set 2 · 2 marks · NAT · Easy
The number of onto functions (surjective functions) from set
X
=
{
1
,
2
,
3
,
4
}
X = \{1, 2, 3, 4\}
X
=
{
1
,
2
,
3
,
4
}
to set
Y
=
{
a
,
b
,
c
}
Y = \{a, b, c\}
Y
=
{
a
,
b
,
c
}
is ____.
21
CS 2015 Set 3 · 1 mark · NAT · Moderate
Consider a software project with the following information domain characteristics for calculation of function point metric.
22
CS 2015 Set 3 · 1 mark · NAT · Easy
The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is ____.