M

Mr. Dubey • 97.30K Points
Coach

Q. Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

  • (A) 1, 2 and 3
  • (B) 1 and 2 only
  • (C) 2 and 3 only
  • (D) 1 and 3 only
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics