Which of the following is (are) correct?
Floyd-Warshall algorithm is used for all pair shortest paths.
The Shortest path problem is not applicable to a graph with a negative weight cycle.
Bellman-Ford algorithm is used for single source shortest path.
Dijkstra’s algorithm is used for all pair shortest paths.
Consider the following adjacency matrix
| 0 | 1 | 0 | 1 | 1 | |
| 1 | 0 | 1 | 0 | 1 | |
| 0 | 1 | 0 | 0 | 1 | |
| 1 | 0 | 0 | 0 | 1 | |
| 1 | 1 | 1 | 1 | 0 |
which represents graph which has 5 vertices and .
Which of the following is true about the graph ?
The number of vertices in G of degree 3 are 3.
The total number of edges in G are 7.
The total number of edges in G are 14.
There is a cycle in G.
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 Mathematics for Data Science I (Maths 1) End Term paper sat on 1 Sept 2024, in the May 2024 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 1 Sept 2024 at a glance |
|---|---|
| Term | May 2024 term |
| Subject | Mathematics for Data Science I |
| Course code | BSMA1001 |
| Questions | 16 |
| Marks | 50 |
| Duration | 180 min |
| MSQ | 6 |
| Numerical | 6 |
| MCQ | 4 |
| Official paper | IIT M FOUNDATION DIPLOMA FN EXAM QDF1 01 Sep 2024 |
| Negative marking | No negative marking. |
| Updated |
