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. Dijkstra’s algorithm is based on
a. Divide and conquer paradigm
b. Dynamic Programming
c. Greedy Approach
d. Backtracking paradigm
Answer:Greedy Approach
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: