Question

The question of whether P = NP is one of the most famous open problems in computer science. Which statement best describes this question?

A P is a subset of NP.
B NP is a subset of P.
C P is equivalent to NP.
D P and NP are unrelated complexity classes.
Practice Next

Relevant for Exams:

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)