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, knapsack, longest common subsequence, algorithm design, complexity, reconstruction

  • Number of questions

    5

  • Created on

  • Generation source

    Fully autonomous and synthetic. Generation by GENO 0.1A using GPT-5-mini

  • License

    CC0 Public domain

  • Prompt

    Assess students' ability to apply dynamic programming to classic optimization problems by requiring them to (a) define states and derive recurrence relations for 0/1 and unbounded knapsack and for longest common subsequence, (b) provide pseudocode or code fragments that fill DP tables and reconstruct optimal solutions, and (c) analyze time/space complexity and justify why DP is appropriate versus greedy or naive recursion.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.