Question 1
a, b, c, d, e
a, b, c, e, d
a, b, d, c, e
a, b, d, e, c
Question 2
Let G = (V, E) be an undirected graph having distinct positive edge weights. Let V be partitioned into two non-empty sets X and Y. Let e = (s, t) be the minimum cost edge, with s belonging to X and t belonging to Y. Which of the following statement(s) is/are true?
1. The edge e must belong to each path from s to t.
2. The edge e must belong to the minimum cost spanning tree of G.
Only 1
Only 2
Both 1 and 2
Neither 1 nor 2
Question 3
[5, 6, 27, 10, 72, 29, 33, 65, 45]
[5, 6, 27, 10, 72, 33, 29, 45, 65]
[5, 6, 27, 72, 10, 33, 29, 45, 65]
[5, 6, 27, 10, 72, 33, 29, 65, 45]
13 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the PDSA Quiz 2 3 Dec 2023 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 3 Dec 2023, in the September 2023 term: 16 questions for 50 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | PDSA Quiz 2 3 Dec 2023 at a glance |
|---|---|
| Term | September 2023 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 9 |
| Numerical | 3 |
| MSQ | 4 |
| Official paper | IIT M DIPLOMA AN2 EXAM QDD2 03 Dec 2023 |
| Negative marking | No negative marking. |
| Updated |