Computer Sciences > Gate 2015 Set-1 > Algorithms

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Match the following

(P) Prim’s algorithm for minimum spanning tree	(i) Backtracking
(Q) Floyd-Warshall algorithm for all pairs shortest paths	(ii) Greedy method
(R) Mergesort	(iii) Dynamic programming
(S) Hamiltonian circuit	(iv) Divide and conquer

A

P-iii, Q-ii, R-iv, S-i

B

P-i, Q-ii, R-iv, S-iii

C

P-ii, Q-iii, R-iv, S-i

D

P-ii, Q-i, R-iii, S-iv

Check Answer

Explanation

Correct : Algorithms

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science