Metadata
Technology & Computer Science Graduate Remember Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Graduate

  • Cognitive goals

    Remember

  • Difficulty estimate

    Medium

  • Tags

    complexity theory, P, NP, NP-complete, NP-hard, reductions

  • Number of questions

    5

  • Created on

  • Generation source

  • License

    CC0 Public domain

  • Prompt

    Assess graduate students' recall of formal definitions and basic relationships among the complexity classes P, NP, co-NP, PSPACE, and the notions NP-hard and NP-complete, plus the formal definitions and roles of polynomial-time many-one and Turing reductions; tasks include stating definitions, identifying class membership for example problems, and recalling standard containment and completeness criteria.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.