Question
In the design and analysis of algorithms, which of the
following algorithms is based on the greedy approach?Solution
Dijkstra’s algorithm is based on the greedy approach, which selects the locally optimal solution at each step with the goal of finding the shortest path from the source to all other vertices in a graph. The algorithm repeatedly picks the nearest unvisited vertex and calculates the shortest path to all its neighbors, ensuring optimal solutions for each subproblem. Merge Sort : A divide-and-conquer algorithm, not greedy. Depth-First Search : DFS is a traversal technique, not a greedy algorithm. Bellman-Ford Algorithm : This algorithm can handle negative weight edges, but it is not based on the greedy approach. Quick Sort : A divide-and-conquer algorithm, not greedy.
Out of 17 essential nutrients that are recognized by universally essential for growth & Development of plant which one of the following is Macronutrien...
Which IPM strategy involves using physical barriers or traps to prevent pests from reaching crops?
Seeds are formed but the embryos develop without fertilization in
The Law of Segregation states that:Â
The mineral source of plant nutrient Boron whose deficiency leads to pollen sterility isÂ
Which of the following parameter is not included in the Soil health card?Â
Lichens, the pioneer organisms that initiate ecological succession are actually a symbiotic association of
Which of the following is responsible for rooting of semi hardwood cuttings of Hibiscus?
In animal breeding, what is the term for those who have a common ancestor, but are not as closely related as in close inbreeding?
What should be the optimum temperature range for the growth of mesophilic bacteria?Â
