Quiz Space

Mathematics for Data Science I · End Term · 1 Sept 2024 · May 2024 term

Maths 1 End Term 1 Sept 2024 — Question 1

Question 1

+4 marksOne or more correct options

Which of the following is (are) correct?

Select all that apply.

  1. A

    Floyd-Warshall algorithm is used for all pair shortest paths.

  2. B

    The Shortest path problem is not applicable to a graph with a negative weight cycle.

  3. C

    Bellman-Ford algorithm is used for single source shortest path.

  4. D

    Dijkstra’s algorithm is used for all pair shortest paths.

Show answer

Correct answers

  • A

    Floyd-Warshall algorithm is used for all pair shortest paths.

  • B

    The Shortest path problem is not applicable to a graph with a negative weight cycle.

  • C

    Bellman-Ford algorithm is used for single source shortest path.

See the whole paperTake it as a mock test

Question 1 of 16 in the IIT Madras BS Mathematics for Data Science I (Maths 1) End Term paper sat on 1 Sept 2024, in the May 2024 term (IIT M FOUNDATION DIPLOMA FN EXAM QDF1 01 Sep 2024). It carries 4 marks.

More questions from this paper

  1. Q2Consider the following adjacency matrix | | A | B | C | D | E | |---|---|---|---|---|---| | A | 0 | 1 | 0 | 1 | 1 | | B…
  2. Q3Figure question
  3. Q4Figure question
  4. Q5Figure question
  5. Q6Figure question
  6. Q7You have been closely monitoring your bike's mileage recently. Here is a table showing two rows representing the amount…
  7. Q8Consider a weighted graph G with 7 vertices { rows and columns are in the order V_1, V_2, V_3, V_4, V_5, V_6, V_7}, whi…
  8. Q9Consider a weighted graph G with 7 vertices { rows and columns are in the order V_1, V_2, V_3, V_4, V_5, V_6, V_7}, whi…
  9. Q10Based on the above data, answer the given subquestions.
  10. Q11Based on the above data, answer the given subquestions.
  11. Q12Figure question
  12. Q13Choose the correct option(s).
  13. Q14Figure question
  14. Q15Figure question
  15. Q16Figure question