Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 31 Aug 2025 · May 2025 term · Set QDD3

Question 5: Given a graph where all edges have positive weights, the …

Question 5

+4 marksOne correct option

Given a graph where all edges have positive weights, the shortest path identified by Dijkstra's and Bellman Ford algorithm may be different but path weight would be same.

  1. A

    TRUE

  2. B

    FALSE

Show answer

Correct answer

  • A

    TRUE

See the whole paperTake it as a mock test

Question 5 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 4 marks.

More questions from this paper

  1. Q1Figure question
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Consider the following statements:\ While creating a DFS tree for a directed graph, among non-tree edges, only back edg…
  5. Q6Figure question
  6. Q7Figure question
  7. Q8Figure question
  8. Q9Figure question
  9. Q10Figure question
  10. Q11Figure question
  11. Q12Figure question
  12. Q13Figure question
  13. Q14Figure question
  14. Q15Figure question
  15. Q16Figure question
  16. Q17Figure question
  17. Q18Figure question
  18. Q19Figure question
  19. Q20Figure question
  20. Q21What is the maximum number of edges in a directed graph with 9 vertices?
  21. Q22Figure question
  22. Q23What is the minimum possible height of a binary tree with 12 nodes (assuming the empty tree height is 0)?
  23. Q24Figure question
  24. Q25Figure question