CS502 GDB No. 1 Spring 2020 Due date 18-08-2020
Fundamentals of Algorithms (CS502)Graded Discussion Board (GDB)Dear Students,GDB of the subject Fundamentals of Algorithms (CS502) is going to upload in a couple of days, before submitting the GDB, please read all instructions thoroughly.The GDB will remain open for two days (48 hours).You may submit your GDB from “August 17, 2020 To August 18, 2020, 11:59 PM”.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.a) Dynamic programmingb) Greedy strategyc) Divide and Conquer strategyIn the given scenario which strategy would be more appropriate and produce optimal solution, comment with proper reasons.Regards,Instructor CS502See More
from Latest Activity on Virtual University of Pakistan https://ift.tt/2DFRnIP
0 comments:
Post a Comment