Computer Science · Theory of Computation
Consider the following statements regarding complexity classes: A. If some NP-complete problem P is in P, then P = NP. B. Traveling Salesperson Problem (TSP) decision variant is in NP. C. Boolean Satisfiability Problem (SAT) is in NP. D. Hamiltonian Circuit Problem is not NP-complete. Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1D, A and B only
- 2C, D and A only
- 3B, C and D only
- 4A, B and C only✓
Correct answer
A, B and C only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Theory of Computation MCQs →Want more practice questions on Theory of Computation?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Theory of Computation