Скачать или смотреть CS502 GDB No. 1 Solution

CS502 (Fundamental of Algorithm) GDB No. 1 Solution 2020
GDB Topic:
Consider the scenario where you need to climb Margala Hills. You have a map pertaining multiple hiking trails like, trail 1, trail 2 etc. in order to reach at the top of hill. You have limited time and want an optimal choice to climb the hill without getting too much tired. You have the following three strategies in your toolkit to accomplish this task:
Dynamic programming
Greedy strategy
Divide and conquer strategy
In the given scenario which strategy would be more appropriate and produce optimal solution, comment with proper reasons.

Rare Academy of Science
Email id: [email protected]