M
Explanation by: Mr. Dubey
np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms.
You must be Logged in to update hint/solution
Related MCQs
Q. The capacity of 3.5 inch floppy disk is
Q. _ helps meet psychological and cognitive processing needs, increases human confidence.
Q. In an even-parity system, the following data will produce a parity bit = 1. data = 1010011
Q. Which of the following is not a SQA plan for a project?
Q. A software that lies between the OS and the applications running on it.
Discusssion
Login to discuss.