We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Click Here To Join also Our facebook study Group...How to Join Subject Study Groups & Get Helping Material?..
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
ap kindly 2 opposite ans de k aur confuse na krein students ko be at one side
ap 2 diff ans de k conuse an krein students ko be at one side
plz don't confused other student.Me Dynamic Programming best hey ager is per reaserch ker k dekh lye .abhi yeh video link hy may be help kr dey better answer find krny me .
I think too
Its mine post
In the ATM machines there are 2 to 4 numbers of cassette boxes for different currency notes for dispensing. As the Dynamic Approach ensure the global optimality of the solution, is numerically stable and allows for hard constraints to be enforced on the behavior of the solution within a natural and straightforward structure so this is suitable or giving the optimal solution for drawing the required amount of Rs. 3600/- from the ATM, because Dynamic Approach will analyze the entire the system and select the minimum numbers of currency notes in order to get the required amount i.e. 3 notes of Rs. 1000/-, 1 note of Rs. 500/- and 1 note of Rs. 100/- total Rs. 3600/-, whereas, the Greedy Approach will select the currency notes as found immediate or nearest, means, in this approach there is no need to analyze the entire system, it may be drawn any numbers of currency notes as it found first. So Greedy Approach will not give the optimal solution.
ye to confuse kr diya ap ny ab confrm btyn kon sa option si hy isk liye plz
Greedy approach is best