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

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question : In what time can the Hamiltonian path problem can be solved using dynamic programming?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(N² 2^N)
Answer : 4 - O(N² 2^N)

* 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