Computer Science · Algorithms
Consider the following statements: Statement 1: The Greedy technique always solves a problem correctly and guarantees a globally optimized solution. Statement 2: Bellman-Ford, Floyd-Warshall, and Prim's algorithms all use the Dynamic Programming technique to solve path problems. Which of the following is true?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both Statement 1 and Statement 2 are true
- 2Both Statement 1 and Statement 2 are false✓
- 3Only Statement 2 is false
- 4Only Statement 1 is true
Correct answer
Both Statement 1 and Statement 2 are false
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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms