Metadata
Technology & Computer Science Grade 9-12 Analyze Hard-
Subject
Technology & Computer Science
-
Education level
Grade 9-12
-
Cognitive goals
Analyze
-
Difficulty estimate
Hard
-
Tags
algorithms, divide-and-conquer, dynamic programming, greedy, time-space tradeoffs, complexity
-
Number of questions
5
-
Created on
-
Generation source
-
License
CC0 Public domain
-
Prompt
Assess students' ability to analyze and compare algorithmic strategies—divide-and-conquer, dynamic programming, and greedy—including selecting appropriate approaches and explaining time–space trade-offs. Problems include Fibonacci (recursive vs memoized vs iterative), 0/1 knapsack, and matrix-chain multiplication; tasks: complexity analysis, correctness justification, and strategy conversion.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.