aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 3 - Theory of Computation | Computer Science
  • The problems 3-SAT and 2-SAT are
Multiple choice

The problems 3-SAT and 2-SAT are

  1. both in P

  2. both NP-complete

  3. NP-complete and in P respectively

  4. undecidable and NP-complete respectively

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

3 SAT problem is both NP & NP hard so it is NP complete, but 2 SAT problem is solvable in Polynomial time so it is in class P.

Keep practicing — related questions

  • Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Whi...
  • Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Whi...
  • Ram and Shyam have been asked to show that a certain problem $\prod$is NP-complete. Ram shows a polynomial ...
  • Ram and Shyam have been asked to show that a certain problem $\prod$is NP-complete. Ram shows a polynomial ...
  • Which two statements are equivalent? 1. 3/2 2. 3<2 3. 3*4 4. 3<<2
  • Which of the following compounds will not undergo Cannizzaro reaction? 1. (CH3)3CCHO 2. C6H5CHO 3. C6H5CH2C...
  • If 1 + 1 = 0 2 + 2 = 2 3 + 3 = 24, then 4 + 4 = ?
  • Which of the following ligands do not show linkage isomerism? (1) SO32- (2) NO2- (3) EDTA4- (4) C2O42- (5) ...
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Logic and Fallacies (1803 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy