Computer Science 413: Dynamic Programming and Memoization

Dynamic Programming and Memoization

Lecture #11: Dynamic Programming and Memoization

• Lecture Notes
• Supplemental Document: Additional Details about the Algorithms Introduced in Lecture #11
• Questions for Review

Tutorial Exercise #11: Improving a Slow “Divide and Cunquer” Algorithm using “Dynamic Programming”

• Problems To Be Solved

Lecture #12: Identification of a Longest Common Subsequence

• Lecture Notes
• Supplemental Document: Additional Details about the Algorithms Introduced in Lecture #12
• Questions for Review

Tutorial Exercise #12: Improving a Slow “Divide and Conquer” Algorithm using “Memoization”

• Problems To Be Solved

Lecture #13: Weighted Activity Selection

• Lecture Notes
• Questions for Review

Lecture #14: Parsing for Context-Free Grammars in Chomsky Normal Form

• Lecture Notes
• Supplemental Document: Additional Details about the Algorithms Introduced in Lecture #14
• Questions for Review

Tutorial Exercise #13: Choosing an Interesting Path using Dynamic Programmming

• Problems To Be Solved

Tutorial Exercise #14: Choosing an Interesting Path using Memoization

• Problems To Be Solved

Assignment #3: Dynamic Programming and Memoization

• Problems To Be Solved

cpsc 413 computer science faculty of science u of c

CPSC 413 introduction and math review analysis of algorithms divide and conquer dynamic programming greedy algorithms complexity theory assignments tests