Q. Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct Answer: (A) true
Explanation: bellmann ford algorithm returns true if the graph does not have any negative weight cycles and returns false when the graph has negative weight cycles.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
bellmann ford algorithm returns true if the graph does not have any negative weight cycles and returns false when the graph has negative weight cycles.

πŸ’¬ Discussion

Related MCQs

Q. The DHCP server

Q. The inverter OR-gate and AND gate are called deeision-making elements because they can recognize some input while disregarding others. A gate

Q. ……………. Is a pile in which items are added at one end and removed from the other.

Q. Standard approach for implementation of a list is/are of

Q. Which of the following is not a phase of virtual circuit network?

Q. A graph is planar if and only if it does not contain ________.

Q. Peocess of hiting several keys at once is called

Q. What will be the output of the following Python expression? 0x35 | 0x75

Q. If b is a dictionary, what does any(b) do?

Q. Which character function can be used to return a specified portion of a character string?

πŸ“Š Question Analytics

πŸ‘οΈ
548
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
87%
Success Rate