GATE Papers >> CSE >> 2013 >> Question No 18

Question No. 18 CSE | GATE 2013

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.


Answer : (A) 1, 2 and 3


Comments
No Comments
Leave a comment
Go