aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Computer Science (GATE Exam) 2009 - Previous Question Paper Solution
  • Let $\pi_A$ be a problem that belongs to the class NP. Th...
Multiple choice

Let $\pi_A$ be a problem that belongs to the class NP. Then which one of the following is TRUE?

  1. There is no polynomial time algorithm for $\pi_A$.
  2. If $\pi_A$ can be solved deterministically in polynomial time, then P = NP.
  3. If $\pi_A$ is NP-hard, then it is NP-complete.
  4. $\pi_A$ may be un decidable.
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Keep practicing — related questions

  • Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in ...
  • Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial ti...
  • Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial ti...
  • Let x[n] = x[-n]. Let X(z) be the z-transform of x[n]. If 0.5 + j0.25 is a zero of X(z), which one of the f...
  • Suppose that the modulating signal is m(t) = 2cos (2$\pi$fmt) and the carrier signal is xC(t) = AC cos(2$\p...
  • Compared to a p-n junction with NA=ND=1014/cm3, which one of the following statements is TRUE for a p-n jun...
  • Which of the following methods of Observable class returns the true value if the invoking object is modifie...
  • Which of the following methods of Font class returns the name of the font family to which the invoking font...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy