Algorithms | NP Complete | Question 6

Which of the following is true about NP-Complete and NP-Hard problems.
(A) If we want to prove that a problem X is NP-Hard, we take a known NP-Hard problem Y and reduce Y to X
(B) The first problem that was proved as NP-complete was the circuit satisfiability problem.
(C) NP-complete is a subset of NP Hard
(D) All of the above
(E) None of the above

Answer: (D)
Explanation: See NP-Completeness

Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-NP Complete

Recommended Articles

1. Algorithms | NP Complete | Question 1

2. Algorithms | NP Complete | Question 2

3. Algorithms | NP Complete | Question 3

4. Algorithms | NP Complete | Question 4

5. Algorithms | NP Complete | Question 5

6. Algorithms | Analysis of Algorithms (Recurrences) | Question 1

7. Algorithms | Analysis of Algorithms (Recurrences) | Question 2

8. Algorithms | Analysis of Algorithms | Question 2

9. Algorithms | Analysis of Algorithms | Question 3

10. Algorithms | Analysis of Algorithms | Question 4

11. Algorithms | Analysis of Algorithms | Question 5

12. Algorithms | Analysis of Algorithms | Question 19

13. Algorithms | Analysis of Algorithms (Recurrences) | Question 4

14. Algorithms | Analysis of Algorithms | Question 8

15. Algorithms | Analysis of Algorithms | Question 9

16. Algorithms | Analysis of Algorithms | Question 10

17. Algorithms | Analysis of Algorithms | Question 11

18. Algorithms | Analysis of Algorithms | Question 12

19. Algorithms | Analysis of Algorithms (Recurrences) | Question 11

20. Algorithms | Analysis of Algorithms (Recurrences) | Question 6

21. Algorithms | Analysis of Algorithms | Question 13

22. Algorithms | Analysis of Algorithms (Recurrences) | Question 7

23. Algorithms | Analysis of Algorithms (Recurrences) | Question 8

24. Algorithms | Analysis of Algorithms | Question 15

25. Algorithms | Analysis of Algorithms (Recurrences) | Question 9