Algorithms on Artificial Intelligence related Questions and Answers - Page 3

Question 23 : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is
1. O(n)
2. O(n2)
3. O(n!)
4. O(n/2)
View Answer   Discuss with Members


View 21 - 28 of 28 Questions

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter