Question 13868 – UGC NET JRF November 2020 Paper-2
November 28, 2023Software-Project-Management
November 28, 2023P-NP
|
Question 3
|
The problems 3-SAT and 2-SAT are
|
both in P
|
|
|
both NP complete
|
|
|
NP-complete and in P respectively
|
|
|
undecidable and NP-complete respectively
|
Question 3 Explanation:
SAT → Boolean satisfiability problem & it is a decision problem.
2-SAT and 3-SAT is a NP-complete.
2-SAT and 3-SAT is a NP-complete.
Correct Answer: C
Question 3 Explanation:
SAT → Boolean satisfiability problem & it is a decision problem.
2-SAT and 3-SAT is a NP-complete.
2-SAT and 3-SAT is a NP-complete.