Which of the following statements is/are correct about Dijkstra's algorithm to find the shortest path? I. The shortest path returned by Dijkstra's algorithm always passes through the least number of vertices. II. To decide which vertex to visit next, Dijkstra's algorithm selects the vertex with the minimum known distance among all unvisited vertices.
Only I is correct
Only II is correct
Both I and II are correct
Both I and II are incorrect
The Bellman–Ford algorithm can be used to detect the presence of a negative-weight cycle reachable from the source vertex in a weighted directed graph. Which of the following correctly explains how Bellman–Ford detects a negative-weight cycle?
A negative-weight cycle exists if the shortest distance to any vertex becomes negative at any point during the algorithm.
If, after performing exactly relaxation iterations, an additional relaxation of any edge further reduces a distance value, then a negative-weight cycle is present.
If the algorithm encounters an edge with a negative weight during relaxation, it immediately concludes that a negative-weight cycle exists.
If multiple shortest paths exist between two vertices, the graph must contain a negative-weight cycle.
Which of the following correctly represents the final max-heap after inserting elements 1, 2, 3, 5, 7, 6, and 4 in the given order one by one, starting with an empty heap? Note:- Ensure that the max-heap property is maintained after each insertion.
—
—
—
—
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.
The IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 12 Apr 2026, in the January 2026 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 12 Apr 2026 at a glance |
|---|---|
| Term | January 2026 term |
| Subject | Programming, Data Structures and Algorithms using Python |
| Course code | BSCS2002 |
| Questions | 16 |
| Marks | 50 |
| Duration | 120 min |
| MCQ | 10 |
| MSQ | 2 |
| Written | 4 |
| Official paper | Programming, Data Structures And Algorithms Using Python 06 Apr 26 |
| Negative marking | No negative marking. |
| Updated |
