Prasnya
Continue with Google
Loading
IITM BS Week 11 Mathematics 1 Questions | Prasnya
Mathematics 1 > Week 11
All PYQs
Topic Wise PYQs
Start Weekly Test
Type:
All
Difficulty:
All
Year:
All
20Q
01
What is the weight of a minimum cost spanning tree of the given graph?
Numerical
MEDIUM
4 marks
10 May 2026
02
Which of the following statements are correct?
Multiple correct
MEDIUM
3 marks
10 May 2026
03
What is the total maintenance cost (in hundreds of rupees) of the optimum subset of links?
Comprehension
MEDIUM
3 marks
21 December 2025
04
Find the number of different ways of choosing an optimum subset of links for the given graph.
Comprehension
MEDIUM
3 marks
21 December 2025
05
Which of the following options is true?
Single correct
EASY
3 marks
13 April 2025
06
Which of the following are possible values for
x
x
x
and
y
y
y
?
Comprehension
HARD
4 marks
13 April 2025
07
Consider the following graph
G
G
G
. Which of the following is(are) not a spanning tree of
G
G
G
?
Multiple correct
MEDIUM
4 marks
22 December 2024
08
A directed graph
G
G
G
is shown below. Suppose we are trying to perform an algorithm to find the shortest path from vertex
v
0
v_0
v
0
to
v
4
v_4
v
4
. Which of the following statements is (are) correct?
Single correct
HARD
4 marks
22 December 2024
09
What is the weight of a minimum cost spanning tree of the given graph?
Numerical
HARD
5 marks
22 December 2024
10
Which of the following is (are) correct?
Multiple correct
MEDIUM
4 marks
01 September 2024
11
Suppose we perform Prim's algorithm on the graph
G
G
G
starting from vertex
V
1
V_1
V
1
to find an MCST. Then the order in which the vertices are added is
Comprehension
MEDIUM
4 marks
01 September 2024
12
Find the value of MCST.
Comprehension
EASY
2 marks
01 September 2024
13
Consider the given directed graph
G
G
G
. Which of the following is the longest valid simple path in the graph?
Single correct
HARD
4 marks
28 April 2024
14
Consider the following graph
G
G
G
. What is the total weight of its minimum cost spanning tree?
Numerical
HARD
4 marks
28 April 2024
15
Which of the following is (are) correct?
Multiple correct
MEDIUM
3 marks
24 December 2023
16
Suppose we perform Prim's algorithm on the graph G starting from vertex V1 to find an MCST. Then the order in which the vertices are added is
Comprehension
MEDIUM
4 marks
24 December 2023
17
Find the value MCST.
Comprehension
MEDIUM
2 marks
24 December 2023
18
A company has branches in each of the six cities
C
1
,
C
2
,
…
,
C
6
C_1, C_2, \dots, C_6
C
1
,
C
2
,
…
,
C
6
. Let a relation
R
R
R
be defined as: 1.
R
=
{
(
a
,
b
,
c
)
∣
there is a direct flight between
a
and
b
,
a
≠
b
,
with a fare of rupees
c
}
R = \{(a, b, c) \mid \text{there is a direct flight between } a \text{ and } b, a \neq b, \text{ with a fare of rupees } c\}
R
=
{(
a
,
b
,
c
)
∣
there is a direct flight between
a
and
b
,
a
=
b
,
with a fare of rupees
c
}
2. The elements in the relation
R
R
R
are
(
C
1
,
C
2
,
4000
)
,
(
C
2
,
C
1
,
4000
)
,
(
C
1
,
C
5
,
5000
)
,
(
C
5
,
C
1
,
5000
)
,
(
C
2
,
C
3
,
5000
)
,
(
C
3
,
C
2
,
5000
)
,
(
C
4
,
C
5
,
4000
)
,
(
C
5
,
C
4
,
4000
)
,
(
C
3
,
C
4
,
7000
)
,
(
C
4
,
C
3
,
7000
)
,
(
C
5
,
C
6
,
1000
)
,
(
C
6
,
C
5
,
1000
)
,
(
C
1
,
C
6
,
2000
)
(C_1, C_2, 4000), (C_2, C_1, 4000), (C_1, C_5, 5000), (C_5, C_1, 5000), (C_2, C_3, 5000), (C_3, C_2, 5000), (C_4, C_5, 4000), (C_5, C_4, 4000), (C_3, C_4, 7000), (C_4, C_3, 7000), (C_5, C_6, 1000), (C_6, C_5, 1000), (C_1, C_6, 2000)
(
C
1
,
C
2
,
4000
)
,
(
C
2
,
C
1
,
4000
)
,
(
C
1
,
C
5
,
5000
)
,
(
C
5
,
C
1
,
5000
)
,
(
C
2
,
C
3
,
5000
)
,
(
C
3
,
C
2
,
5000
)
,
(
C
4
,
C
5
,
4000
)
,
(
C
5
,
C
4
,
4000
)
,
(
C
3
,
C
4
,
7000
)
,
(
C
4
,
C
3
,
7000
)
,
(
C
5
,
C
6
,
1000
)
,
(
C
6
,
C
5
,
1000
)
,
(
C
1
,
C
6
,
2000
)
, and
(
C
6
,
C
1
,
2000
)
(C_6, C_1, 2000)
(
C
6
,
C
1
,
2000
)
. An employee of that company wanted to travel from city
C
2
C_2
C
2
to city
C
4
C_4
C
4
. If he traveled by the cheapest route possible, then find the total fare that he should pay.
Numerical
MEDIUM
4 marks
11 December 2022
19
Suppose Nitya wishes to find the minimum cost spanning tree of the graph given below. While finding the minimum cost spanning tree she finds that a few edge weights are missing (
x
x
x
and
y
y
y
) but she is sure that the weight of the minimum cost spanning tree is
15
15
15
in the graph. Which of the following are possible values for
x
x
x
and
y
y
y
?
Multiple correct
HARD
4 marks
11 December 2022
20
What is the weight of a minimum cost spanning tree of the graph given below?
Numerical
MEDIUM
3 marks
07 August 2022
Showing 20 questions.
Complete question index for this section:
Question 1 (integer):
Question 2 (multiple):
Question 3 (comprehension):
Question 4 (comprehension):
Question 5 (single):
Question 6 (comprehension):
Question 7 (multiple):
Question 8 (single):
Question 9 (integer):
Question 10 (multiple):
Question 11 (comprehension):
Question 12 (comprehension):
Question 13 (single):
Question 14 (integer):
Question 15 (multiple):
Question 16 (comprehension):
Question 17 (comprehension):
Question 18 (integer):
Question 19 (multiple):
Question 20 (integer):
