..:: Complexity Classes on Data Structure and Algorithms related Questions and Answers

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question : Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
1. branch and bound
2. iterative improvement
3. divide and conquer
4. greedy algorithm
Answer : 1 - branch and bound

* Be the First to Post a Comment.

Submit comment :

Ask Question

Note : Name and Email never shown.

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

JagSchool of Transformative Skills

PDPM Indian Institute of Information Technology Design Manufacturing

Global Institute Of Technology & Management

Institute for future education Entrepreneurship and leadership

Other Questions

Practice Paper sets

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Submit comment :

Ask Question

Subscribe