Metadata
Technology & Computer Science Graduate Remember Easy
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Graduate

  • Cognitive goals

    Remember

  • Difficulty estimate

    Easy

  • Tags

    complexity, P, NP, co-NP, NP-complete, NP-hard

  • 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 graduate students' basic recall of formal definitions and core distinctions among the complexity classes P, NP, co-NP, NP-complete, and NP-hard; require stating concise definitions, giving canonical examples for each class, describing the role of polynomial-time many-one reductions at a high level, and distinguishing decision versus optimization problems and NP-complete versus NP-hard membership.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.