Metadata
Technology & Computer Science Graduate Analyze Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Graduate

  • Cognitive goals

    Analyze

  • Difficulty estimate

    Medium

  • Tags

    B-tree, LSM-tree, indexing, compaction, performance, time-space trade-offs

  • 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' ability to analyze and compare B-tree and LSM-tree indexing structures by evaluating performance (latency, throughput), time–space trade-offs (write/read amplification, storage overhead), and the effects of varying read/write workloads, dataset sizes, caching, bloom filters, and compaction strategies; include interpretation of benchmark results and reasoned design recommendations.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.