Computer Science · Shortest Path Algorithms
Given below are two statements: Statement I: Dijkstra's algorithm can find the shortest path in a weighted graph with negative edge weights. Statement II: Bellman-Ford algorithm can find the shortest path in a graph with negative edge weights. In light of the above statements, choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement I is incorrect and Statement II is correct✓
- 2Statement I is correct and Statement II is incorrect
- 3Both Statement I and Statement II are incorrect
- 4Both Statement I and Statement II are correct
Correct answer
Statement I is incorrect and Statement II is correct
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Shortest Path Algorithms MCQs →Want more practice questions on Shortest Path Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Shortest Path Algorithms