Quiz Space

Programming, Data Structures and Algorithms using Python · End Term · 1 Sept 2024 · May 2024 term · Set QDF3

Question 8: Which of the following is/are always true about the Bellm…

Question 8

+4 marksOne correct option

Which of the following is/are always true about the Bellman-Ford algorithm?
I. It can not detect negative weight cycles in graph.
II. It works correctly if the graph has negative edge weights but does not have negative weight cycles.
III. It finds the shortest paths from a single source vertex to all other vertices in the graph.

  1. A

    Only statement I and II are correct

  2. B

    Only statement I and III are correct

  3. C

    Only statement II and III are correct

  4. D

    All statements are correct

  5. E

    All statements are incorrect

Show answer

Correct answer

  • C

    Only statement II and III are correct

See the whole paperTake it as a mock test

Question 8 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 1 Sept 2024, in the May 2024 term (IIT M FOUNDATION DIPLOMA AN EXAM QDF3 01 Sep 2024). It carries 4 marks.

More questions from this paper

  1. Q1Figure question
  2. Q2Figure question
  3. Q3Figure question
  4. Q4What is recurrence and time complexity for the worst case of Quick Sort ? Consider that algorithm select last element a…
  5. Q5Figure question
  6. Q6Consider the following graph Which of the following vertex sequence is the correct BFS traversal on the graph started f…
  7. Q7Which of the following statements is true about Dijkstra's algorithm to find the shortest path? I. The shortest path re…
  8. Q9Figure question
  9. Q10Figure question
  10. Q11Figure question
  11. Q12Let Z be an NP-complete problem and X and Y be two other problems not known to be in NP. X is polynomial time reducible…
  12. Q13Figure question
  13. Q14Figure question
  14. Q15Figure question
  15. Q16Figure question
  16. Q17Figure question
  17. Q18Figure question
  18. Q19A baker is preparing an elaborate cake M. The recipe includes preparing several other components, each of which has its…
  19. Q20Consider a binary min-heap implemented using list. Which of the following lists represents a binary min-heap?
  20. Q21Which of the following are possible valid codes for the character set S = {A, B, C, D, E, F}, generated using the Huffm…
  21. Q22Figure question
  22. Q23Consider the network given below with source s and sink t, with the numbers on the edges denoting maximum capacity acro…
  23. Q24Based on the above data, answer the given subquestions.
  24. Q25Based on the above data, answer the given subquestions.