What is the space complexity of Depth-first search?

Artificial Intelligence - Quiz(MCQ)

O(b)

O(bm)

O(m)

O(bl)

Correct Answer : O(bm)

Explanation : O(bm) is the space complexity where b is the branching factor and m is the maximum depth of the search tree.

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)

New Technologies MCQ's

Machine Learning

Artificial Intelligence