Metadata
Technology & Computer Science Grade 9-12 Understand Medium-
Subject
Technology & Computer Science
-
Education level
Grade 9-12
-
Cognitive goals
Understand
-
Difficulty estimate
Medium
-
Tags
big O, time complexity, asymptotic analysis, algorithm comparison, growth rates, space complexity
-
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
Test students' understanding of Big O notation and ability to compare algorithmic efficiency: define asymptotic concepts, common time complexities (O(1), O(log n), O(n), O(n log n), O(n^2)), best/average/worst cases, simplify expressions, analyze short pseudocode snippets for time and space complexity, and rank algorithms by growth rate and practical impact for varying input sizes.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.