**GDB CS502 Solution August 2020 (Spring Semester)**

find the solution file of GDB CS502 Solution August 2020 which is going to be opened on Monday, August 17, 2020 and will be closed on Tuesday, August 18, 2020

### TOPIC OF GDB CS502:

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.

a) Dynamic programming

b) Greedy strategy

c) Divide and Conquer strategy

In the given scenario which strategy would be more appropriate and produce optimal solution, comment with proper reasons.

## The answer to the GDB CS502 Solution August 2020

In my opinion, A greedy strategy is appropriate for the given scenario.

as we know Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.

Example:

a mountain climber using the greedy strategy to climb Everest would at each progression climb the steepest way. By this similarity, we get the computational inquiry procedure known as hill-climbing.