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 _________

Artificial Intelligence - Quiz(MCQ)

O(n)

O(n!)

O(n2)

O(n/2)

Correct Answer : O(n!)

Explanation : 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 O(n!).

Recently Updated in Artificial Intelligence Questions

Which of the following are used for modeling times series and sequences?

Decision graphs

Dynamic Bayesian networks

Parameter tuning

Value of information

Correct Answer : Dynamic Bayesian networks

Explanation : Dynamic Bayesian networks (DBNs) are used for modeling times series and sequences.

The generalized form of Bayesian network that represents and solve decision problems under uncertain knowledge is known as an?

Influence diagram

Directed Acyclic Graph

Table of conditional probabilities

None of the above

Correct Answer : Influence diagram

Explanation : The generalized form of Bayesian network that represents and solve decision problems under uncertain knowledge is known as an Influence diagram

How can you evaluate 1.25 + sqrt (144) in LISP?

1.25+sqrt (1.44)

(1.25+sqrt (1.44))

(+1.25 sqrt (1.44)

All of the above

Correct Answer : (+1.25 sqrt (1.44)