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.
Which of the following statements related to enzymes is correct?
1. They are proteins.
2. They perform their functions in the same locatio...
Which is the highest plateau in India?Â
In December 2021, which online shopping platform rebranded itself as Blinkit?
In June, 2021 which Indian athlete has won the gold medal hat trick in the World Archery?
Who will be hosting the 2023 edition of SCO (Shanghai Cooperation Organization) summit?
Who received the Nobel Prize for their work on the Photoelectric Effect?
In which location are the 'Monolithic Rathas' found?
International Holocaust Remembrance Day is observed on:
Where is the Headquarter of Asian Development Bank?
Recently Telangana Industrial Health Clinic Ltd (TIHCL), a State government initiative, has got RBI clearance to function as a
