1
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
A
Dynamic programming
B
Backtracking
C
Greedy
D
Divide and Conquer
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP