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, algorithm analysis, growth rates
-
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 comparative growth rates for common algorithmic complexities (O(1), O(log n), O(n), O(n log n), O(n^2)). Assess ability to classify code snippets or pseudocode by time complexity, interpret runtime graphs/tables, explain differences in scaling as n increases, and choose the more efficient algorithm for given input sizes and constraints.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.