info@avatto.com
+91-9920808017
0. The correct matching for the following pairs is (A) All pairs shortest path (B) Quicksort (C) Minimum weight spanning tree (D) Connected Components (1) Greedy (2) Depth-first search (3) Dynamic programming (4) Divide and conquer
A-2 , B-4 , C-1 , D-3
A-3 , B-4 , C-1 , D-2
A-3 , B-4 , C-2 , D-1
A-4 , B-1 , C-2 , D-3
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.