Home »
MCQs »
Data Structure and Algorithms (DSA) MCQs
Which of the following algorithmic approaches focuses on achieving a localized optimum solution?
14. Which of the following algorithmic approaches focuses on achieving a localized optimum solution?
- Divide and Conquer Approach
- Greedy Approach
- Dynamic Approach
- All of the above
Answer
The correct answer is: B) Greedy Approach
Explanation
Greedy approach focus is to achieve a local optimum solution.