Metadata
Technology & Computer Science Undergraduate Apply Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Undergraduate

  • Cognitive goals

    Apply

  • Difficulty estimate

    Medium

  • Tags

    dynamic programming, 0/1 knapsack, longest common subsequence, matrix chain multiplication, algorithms

  • Number of questions

    5

  • Created on

  • Generation source

  • License

    CC0 Public domain

  • Prompt

    Assess students' ability to formulate and apply dynamic programming to classic optimization problems—0/1 knapsack, longest common subsequence (LCS), and matrix chain multiplication—by deriving recurrences, designing DP table-filling strategies, performing hand-simulations on small inputs, reconstructing optimal solutions, and analyzing time/space complexity and trade-offs.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.