Question 2
Question 3
Suppose Dijkstra’s algorithm is run on the graph below, starting at node A. In what order do the shortest distances to the other vertices get finalized?
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 Maths 1 End Term 31 Aug 2025 paper
The IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 31 Aug 2025, in the May 2025 term: 16 questions for 50 marks in 180 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 | Maths 1 End Term 31 Aug 2025 at a glance |
|---|---|
| Term | May 2025 term |
| Subject | Mathematics for Data Science I |
| Course code | BSMA1001 |
| Questions | 16 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 3 |
| MSQ | 5 |
| Numerical | 8 |
| Official paper | IIT M DEGREE FN EXAM QDB1 31 Aug 2025 |
| Negative marking | No negative marking. |
| Updated |