400+ Artificial Intelligence (AI) Multiple Choice Questions (MCQs)

1 .

What is the space complexity of Depth-first search?

A)

O(b)

B)

O(bm)

C)

O(m)

D)

O(bl)

Correct Answer : Option (B) : 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.

2 .

Web Crawler is a/an ________

A)

Model based agent

B)

Intelligent goal-based agent

C)

Simple reflex agent

D)

Problem-solving agent

Correct Answer : Option (B) : Intelligent goal-based agent

3 .

A production rule consists of __________

A)

A set of Rule

B)

A sequence of steps

C)

Arbitrary representation to problem

D)

Set of Rule & sequence of steps

Correct Answer : Option (D) : Set of Rule & sequence of steps

Explanation : When you are trying to solve a problem, you should design how to get a step-by-step solution with constraints condition to your problem, e.g Chess board problem.

4 .

Which is the best way to go for Game playing problem?

A)

Linear approach

B)

Random approach

C)

An Optimal approach

D)

Heuristic approach (Some knowledge is stored)

Correct Answer : Option (D) : Heuristic approach (Some knowledge is stored)

Explanation : We use a Heuristic approach, as it will find out brute force computation, looking at hundreds of thousands of positions. e.g Chess competition between Human and AI based Computer.

5 .

Depth-First Search is implemented in recursion with _______ data structure.

A)

LIFO

B)

LILO

C)

FILO

D)

FIFO

Correct Answer : Option (A) : LIFO

Explanation : Depth-First Search implemented in recursion with LIFO stack data structure.

6 .

What is disadvantage of Greedy Best First Search?

A)

This algorithm is neither complete, nor optimal.

B)

may not terminate and go on infinitely on one path

C)

It can get stuck in loops. It is not optimal.

D)

There can be multiple long paths with the cost â‰¤ C*

Correct Answer : Option (C) : It can get stuck in loops. It is not optimal.

Explanation : The disadvantage of Greedy Best First Search is that it can get stuck in loops. It is not optimal.

7 .

How many types of informed search method are in artificial intelligence?

A)

3

B)

4

C)

5

D)

6

Correct Answer : Option (B) : 4

Explanation : The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.

8 .

How many types are available in uninformed search method?

A)

3

B)

4

C)

5

D)

6

Correct Answer : Option (C) : 5

Explanation : The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.

9 .

The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)

A)

O(d2) and O(d2)

B)

O(b2) and O(d2)

C)

O(d2) and O(b2)

D)

O(bd+1) and O(bd+1)

Correct Answer : Option (D) : O(bd+1) and O(bd+1)

Explanation : We consider a hypothetical state space where every state has b successors. The root of the search tree generates b nodes at the first level, each of which generates b more nodes, for a total of b2 at the second level. Each of these generates b more nodes, yielding b3 nodes at the third level, and so on. Now suppose that the solution is at depth d. In the worst case, we would expand all but the last node at level d (since the goal itself is not expanded), generating bd+1- b nodes at level d+1.

10 .

Optimality of BFS is ___________

A)

When all step costs are equal

B)

When all step costs are unequal

C)

When there is less number of nodes

D)

None of the above

Correct Answer : Option (A) : When all step costs are equal