Practice Memoization And Dynamic Programming (23.9)

Practise this section

8 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is dynamic programming?
Show hintHide hint
Think of how recursive functions work.
Question 2.
What is the base case in the factorial function?
Show hintHide hint
Consider what the output should be for zero!
3Question 3.
What does dynamic programming generally focus on?
- Recursive approaches
- Iterative processes built on stored results
- Sorting algorithms only
Show hintHide hint
Think about how dynamic programming reduces repeated calculations.
4Question 4.
True or False: Memoization is a technique that stores previously computed results.
- True
- False
Show hintHide hint
Consider whether ideas have been repeated in your study.
Question 5.
Given an array of weights and values, determine how to maximize value with a weight limit using dynamic programming.
Show hintHide hint
Think of how you can compute values iteratively based on smaller weight limits.
Question 6.
Devise a dynamic programming algorithm to find the longest common subsequence of two strings.
Show hintHide hint
What relationships can you derive between characters of the strings?

4 more questions in this section. Enroll free to practise them all.