Question 1
A, C, F, B, E, D
A, C, F, B, D, E
A, C, B, F, E, D
A, C, B, F, D, E
Question 2
Question 3
Consider a directed graph G with equal edge weights. Which of the following algorithms is most efficient to compute the shortest distance between every pair of nodes in G?
Run BFS once on every node
Run Dijkstra’s algorithm once on every node
Run Bellman Ford’s algorithm once on every node
Run Floyd-Warshall algorithm
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 4 Aug 2024 paper
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 4 Aug 2024, in the May 2024 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 4 Aug 2024 at a glance |
|---|---|
| Term | May 2024 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 10 |
| Numerical | 3 |
| MSQ | 3 |
| Official paper | IIT M DIPLOMA AN EXAM QDD2 4 Aug 2024 |
| Negative marking | No negative marking. |
| Updated |