Dynamic Programming: Memoization and Tabulation
Students will learn basic search techniques to find specific information within a list or collection of data.
About This Topic
Students will learn basic search techniques to find specific information within a list or collection of data.
Key Questions
- Identify the two structural properties,overlapping subproblems and optimal substructure,that make a problem amenable to dynamic programming, and construct a counterexample where only one property holds.
- Design a bottom-up tabulation solution for the 0/1 knapsack problem, derive its time and space complexity, and explain how space can be reduced from O(nW) to O(W).
- Compare a naive recursive solution, a top-down memoized solution, and a bottom-up tabulation solution for the longest common subsequence problem in terms of correctness, time complexity, and practical performance.
Active Learning Ideas
See all activities→Activities & Teaching Strategies
See all activities
More in Abstract Data Structures and Algorithms
Introduction to Computational Thinking
Students will be introduced to the core concepts of computational thinking: decomposition, pattern recognition, abstraction, and algorithms, as problem-solving tools.
8 methodologies
Linked Lists: Implementation and Complexity Analysis
Students will learn basic ways to organize data using simple lists and tables, understanding how this helps in managing information.
8 methodologies
Stacks and Queues: Implementations and Applications
Students will identify and create simple step-by-step instructions (algorithms) for everyday tasks, understanding the importance of order and precision.
8 methodologies
Binary Trees and Binary Search Trees
Students will explore how 'if-then-else' statements allow programs to make decisions and respond to different conditions.
8 methodologies
AVL Trees and Height-Balanced Structures
Students will learn about loops (e.g., 'repeat' or 'for' loops) to perform actions multiple times, making programs more efficient.
8 methodologies
Hash Tables and Collision Resolution Strategies
Students will understand how variables are used to store and retrieve different types of data (numbers, text) in a program.
8 methodologies