We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

Dear students your GDB has been scheduled on 23 to 24 Feb. 2015. All other details are as follow:





Dynamic Programming always supports solutions only for “Optimization Problems and finally leads to decision making.”

You are required to support or contradict above statement by giving solid reasoning; your comments should not be more than 100 words.



1. Short and to the point comments are required. Marks can be deducted on exceeding 100 Words.

2. Use normal font size.

3. In case of plagiarism you will be marked as ‘Poor’ so don’t copy from internet; write in your own words.

4. Don’t post any comment related to Graded MDB on regular MDBs’

5. Don’t send comments via email, it will not be accepted in any case.

6. You can post your comments on 23-02-2015 and 24-02-2015.
Think with peace of mind and heart ! 
All the best  !

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..

See Your Saved Posts Timeline

Views: 3456


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Replies to This Discussion

2,3 log hein jo apne ideas dayte hein baki tu koi bi discussion join hi ni karta

Kiran u r right

good approach Khalid .

Dynamic programming is applicable to problems exhibiting the properties of: overlapping subproblems, and optimal substructure. Optimal substructure means that you can greedily solve subproblems and combine the solutions to solve the larger problem

Dynamic programming is a method for solving a complex problem by breaking it down into sub problems. Optimization problem is to find the best solution among different solution. Decision-making is process of getting result among several alternative possibilities. Every decision-making process produces a final choice that may or may not prompt action. In above lines I support the dynamic problem. If there is small problem. Than we can handle easily. But in case of large programming, if we divide it in small pieces than it will be easy to understand and modify. We can get error quickly and recover it.


© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service