Q. A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
✅ Correct Answer: (A)
true
Explanation: one of the properties of np class problems states that a non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.