Q473
Which of the following is an NP complete problem?
A.
Hamiltonian cycle
B.
Travelling salesman problem
C.
Calculating chromatic number of graph
AnswerD.
Finding maximum element in an array
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board