![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
How many steps are required to prove that a decision problem is NP complete? |
A. | 1 |
B. | 2 |
C. | 3 |
D. | 4 |
Answer» B. 2 | |
Explanation: first, the problem should be np. next, it should be proved that every problem in np is reducible to the problem in question in polynomial time. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet