Question

What is the full form of NP complexity?

(a) Non-deterministic polynomial time

(b) Non-linear polynomial time

(c) Non-probabilistic polynomial time

(d) Non-trainable polynomial time

I have been asked this question during an interview.

This interesting question is from Architecture in division Cognitive Radio Architecture of Cognitive Radio

Answer 1

The correct option is (a) Non-deterministic polynomial time

For explanation I would say: The non-deterministic polynomial time is a complexity class in the computational complexity theory. It is used to differentiate decision problems. NP is a collection of decision problems. When a decision results in action, it must have proof that can be confirmed in polynomial time by a deterministic Turing machine.