Q. What does NP stands for in complexity classes theory?

View solution

Q. The hardest of NP problems can be:

View solution

Q. Which of the following contains NP?

View solution

Q. Travelling sales man problem belongs to which of the class?

View solution

Q. State true or false?
Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.

View solution

Q. A problem which is both _______ and _________ is said to be NP complete.

View solution

Q. Which of the following is incorrect for the given phrase:

'solvable by non deterministic algorithms in polynomial time'

View solution

Q. In terms of NTIME, NP problems are the set of decision problems which can be solved using a non deterministic machine in _______ time.

View solution

Q. Which of the following can be used to define NP complexity class?

View solution

Q. Which of the following are not in NP?

View solution

Q. Which of the following does not belong to the closure properties of NP class?

View solution

Q. Which of the given problems are NP-complete?

View solution

Q. Which of the following problems do not belong to Karp’s 21 NP-complete problems?

View solution

Q. Which of the following problems were reduced to Knapsack?

View solution

Q. An exact cover problem can be represented using:

View solution

Q. For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?

View solution

Q. Hamilton circuit problem can have the following version/s as per the input graph:

View solution

Q. Hamilton Circuit problem is a special case of ____________

View solution

Q. Which of the following cannot solve Hamilton Circuit problem?

View solution

Q. State true or false:
Statement: Hamiltonian cycles through any fixed edge is always even, so if one such cycle is given, the second one must also exists.

View solution