Use of English
Part 3 - Word Formation
For Questions 1-8, read the text below and use the word given in capitals to form a word that fits in the gap.
Dynamic Programming in Practice
Dynamic programming is a (0) POWERFUL (POWER) technique for solving problems by breaking them into smaller parts. The key idea is to avoid (1) .......... (REPEAT) work by storing results you have already computed. In many cases, the first step is to define a clear (2) .......... (RELATE) between a problem and its subproblems. Once that is done, you choose an approach: either build solutions from the bottom up, or use top-down recursion with (3) .......... (MEMORISE). Both methods rely on the same principle: each subproblem should be solved once. However, dynamic programming is not always the best choice. If subproblems do not overlap, the method becomes (4) .......... (EFFECT) and may even slow your program down. Another common issue is (5) .......... (CLEAR): if you cannot state what your “state” represents, your solution will be hard to implement and test. When it is applied correctly, the (6) .......... (IMPROVE) can be dramatic, often reducing time complexity from exponential to polynomial. Still, you must pay attention to memory (7) .......... (CONSUME), because storing large tables can be expensive. For this reason, careful (8) .......... (ANALYSE) of constraints is essential before you commit to a DP solution.
Instructions
For Questions 1-8, read the text below and use the word given in capitals to form a word that fits in the gap.
Exercise Details
Author
Hailey Sumner
@haileys
User Prompt
"Create an exercise explaining how dynamic programming works"
Created on:
Mar 25, 2026
Found an issue? Let us know.
