Match the methodology of List-A with the application of List
Match the methodology of List-A with the application of List-B :
Aa->III b->I c->IV d->II
Ba->IV b->III c->II d->I
Ca->III b->IV c->I d->II
Da->III b->II c->I d->IV
All DiscussionsClick here to write answer
Answer : a->III b->I c->IV d->II
Explanation:
A “greedy algorithm” is optimization problem is one in which you want to find, not just a solution, but the best solution
Example: Finding MST using Kruskal’s algorithm (min-weight spanning tree)
A DFS algorithm is used to find strongly connected component.
A dynamic programming algorithm remembers past results and uses them to find new results example:Floyd–Warshall algorithm (All Pair Shortest path algorithm)
A divide and conquer algorithm consists of two parts:
Divide the problem into smaller subproblems of the same type, and solve these subproblems recursively
Combine the solutions to the subproblems into a solution to the original problem
Example: quicksort
All Comments
Post your answers here:
Post
