Assess students' ability to convert recursive algorithms into efficient dynamic programming solutions by identifying overlapping subproblems and optimal substructure, defining states and transitions, choosing memoization vs bottom-up table filling, implementing and reconstructing solutions for 0/1 knapsack and longest common subsequence, and analyzing time/space complexity; require pseudocode and brief correctness/performance explanations.