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 increasing subsequence, edit distance, algorithms, complexity

  • 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 intermediate algorithmic problems (0/1 knapsack, longest increasing subsequence, edit distance). Test skills in defining states and recurrences, choosing memoization vs tabulation, implementing and tracing DP algorithms, reconstructing optimal solutions, and analyzing time/space complexity and correctness.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.