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

Complexity Classes on Data Structure and Algorithms related Questions and Answers

Question : What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
1. O(N!)
2. O(N! * N)
3. O(log N)
4. O(N)
Answer : 2 - O(N! * 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