A problem is said to be in NP if:

Bihar STET · PGT (Paper 2) · Computer Science · 2025

1. A.

   Its solution can be verified in polynomial time

2. B.

   It can be solved using a non-deterministic algorithm

3. C.

   It is not solvable

4. D.

   It has exponential complexity

Attempted by 456 students.

The worked solution is available to enrolled students.