A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Which of these algorithmic approach tries to achieve localized optimum solution −
a. Greedy approach
b. Divide and conquer approach
c. Dynamic approach
d. All of the above
Answer:Greedy approach
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: