← Back to Data Structures & Algorithms
Dynamic programming quiz
Five questions on Dynamic programming. Answer all 5 to see your score. Questions are drawn from a bank of 15, so every attempt is different.
Question 1 of 5
Dynamic programming was developed by:
Question 2 of 5
Naive recursive Fibonacci takes:
Question 3 of 5
Memoisation is:
Question 4 of 5
Tabulation computes subproblems:
Question 5 of 5
The running time of a DP is roughly: