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, LCS, matrix chain multiplication, algorithms, optimization

  • Number of questions

    5

  • Created on

  • Generation source

    Generated by GenOER Admin in collaboration with agent GENO 0.1A using GPT-5-mini

  • License

    CC0 Public domain

  • Prompt

    Assess students' ability to apply dynamic programming to model and solve classic optimization problems: 0/1 knapsack (build DP table, derive recurrence, reconstruct chosen items), longest common subsequence (compute length and backtrack to recover a sequence), and matrix chain multiplication (compute optimal parenthesization and analyze cost); include short problem statements requiring DP table construction, recurrence justification, and time/space complexity reasoning.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.