Which of the given problems are NP-complete?

Question

TuteeHUB · Accepted Answer

None of the mentioned

TuteeHUB · Answer

Node cover problems

TuteeHUB · Answer

Directed Hamilton Circuit Problem

TuteeHUB · Answer

Node cover problems & Directed Hamilton Circuit Problem

TuteeHUB · Answer

None of the mentioned

1.	Which of the given problems are NP-complete?
A.	Node cover problems
B.	Directed Hamilton Circuit Problem
C.	Node cover problems & Directed Hamilton Circuit Problem
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion