Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question :   The problem of finding a path in a graph that visits every vertex exactly once is called? 1. Hamiltonian path problem 2. Hamiltonian cycle problem 3. Subset sum problem 4. Turnpike reconstruction problem Answer :   1 - Hamiltonian path problem