

MCQOPTIONS
Saved Bookmarks
1. |
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 |
Answer» B. Non-linear polynomial time | |