Metadata
Technology & Computer Science Grade 6-8 Analyze Hard-
Subject
Technology & Computer Science
-
Education level
Grade 6-8
-
Cognitive goals
Analyze
-
Difficulty estimate
Hard
-
Tags
search, sorting, tracing, time complexity, space complexity, algorithm selection
-
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
Assess students' ability to trace linear vs. binary search and bubble, insertion, and selection sorts step-by-step on small arrays, compare their best/average/worst-case time and space complexities, explain stability and practical trade-offs (nearly-sorted data, memory limits, need for stability), and justify algorithm choice for several given scenarios; require trace tables, complexity annotations, and short written justifications.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.