Consider the following Statements

Statement 1: Greedy technique solves the problem correctly and always provides an optimized solution to the problem.

Statement 2: Bellman ford, Floyd-warshal, and Prim’s algorithms use the Dynamic Programming technique to solve the Path problems.

Which of the following is true?

1
Statement 1 is true only
2
Statement 2 is false only
3
Statement 1 and Statement 2 both are false.
4
Statement 1 and Statement 2 both are true.
5
Question Not Attempted

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation