0

Which of following is FALSE?

(A) {< x, y > | x and y are integers, gcd (x, y) = 1} is a NP class problem.

(B) CLIQUE is a NP class problem.

(C) Eulerian PATH is a P class problem

(D) Dijkstra’s algorithm is a problem in P.

Asked question