Metadata
Technology & Computer Science Any Level Understand Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Any Level

  • Cognitive goals

    Understand

  • Difficulty estimate

    Medium

  • Tags

    big O, time complexity, algorithms, asymptotic analysis, logarithms

  • 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' understanding of algorithmic time complexity and Big O notation by comparing O(1), O(log n), O(n), O(n log n), and O(n^2). Include tasks to rank growth rates, classify short code snippets, and justify performance trade-offs concisely.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.