Metadata
Technology & Computer Science Grade 6-8 Analyze Hard
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Grade 6-8

  • Cognitive goals

    Analyze

  • Difficulty estimate

    Hard

  • Tags

    sorting, bubble sort, insertion sort, selection sort, algorithm analysis

  • 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 bubble, insertion, and selection sorts step-by-step on short lists, compute and explain best- and worst-case step counts (comparisons and swaps) as functions of n, and analyze which algorithm is most suitable for nearly-sorted, small, or larger lists; include one trace example per algorithm, derive or justify the step-count formulas, and compare trade-offs in plain language for Grade 6–8 learners.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.