DSGN & ANALYSIS OF ALGORITHMS
DSGN & ANALYSIS OF ALGORITHMS CSCD 501
Eastern Washington University
Popular in Course
Popular in ComputerScienence
This 2 page Class Notes was uploaded by Dewitt Paucek on Sunday October 11, 2015. The Class Notes belongs to CSCD 501 at Eastern Washington University taught by Timothy Rolfe in Fall. Since its upload, it has received 24 views. For similar materials see /class/221497/cscd-501-eastern-washington-university in ComputerScienence at Eastern Washington University.
Reviews for DSGN & ANALYSIS OF ALGORITHMS
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/11/15
Dynamic Programming With Divide and Conquer topdown technique 0 Divide instance into subinstances o Solve subinstances 0 Combine solutions to solve original instance 0 May lead to several overlapping subinstances causing an inefficient algorithm Dynamic programming bottomup technique 0 Normally start with the smallest simplest subinstances 0 May combine subinstance solutions obtaining answers to subinstances of increasing size 0 Can take advantage of any overlapping subinstances 0 Keep track of known results in a table Printed on 20100331 at 1933
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'