Greedy Method | Krushkal’s | Dijkstra’s algorithm | knapsack instance

interview questions for Greedy Method  | Krushkal’s | Dijkstra’s algorithm  | knapsack instance
1. control abstraction of the greedy method.
2.  greedy method  | algorithm | solve knapsack problem
3. optimal solution | knapsack instance
4 optimal merge pattern | algorithm | generate | two way merge pattern .
5.optimal binary merge pattern for given example
6. greedy algorithm | sequencing unit time jobs with deadline and profits.
8.Minimal spanning tree
the PRIM’S algorithm
9.find the minimum cost spanning tree using
1O.prim’s algorithm 2.Krushkal’s algorithm
11.explain Dijkstra’s algorithm

Share This