aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Algorithms - GATE Previous Year Questions
  • 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...
  • Which of the following methods of Thread class returns a true value if the thread is still active?
  • Why is there a need for virtual base class in hybrid/diamond inheritance? Multiple inheritance: more than o...
  • Which of the following methods of Class returns a Class object for each of the public classes and interface...
  • Which of the following is the possible procedure to procure that should be followed by the teacher, after t...
  • What will be the output of following code? class Base { public: void display() {cout<<”t base d”; } virtual...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy