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

1 .

Which search algorithm will use limited amount of memory?

A)

RBFS

B)

SMA*

C)

Hill-climbing search algorithm

D)

Both RBFS & SMA*

Correct Answer : Option (D) : Both RBFS & SMA*

Explanation : RBFE and SMA* will solve any kind of problem that A* can’t by using limited amount of memory.

2 .

What is the main task of a problem-solving agent?

A)

Solve the given problem and reach to goal

B)

To find out which sequence of action will get it to the goal state

C)

Both (a) and (b)

D)

None of the above

Correct Answer : Option (C) : Both (a) and (b)

3 .

What is state space?

A)

Representing your problem with variable and parameter

B)

The whole problem

C)

Problem you design

D)

Your Definition to a problem

Correct Answer : Option (A) : Representing your problem with variable and parameter

Explanation : Because state space is mostly concerned with a problem, when you try to solve a problem, we have to design a mathematical structure to the problem, which can only be through variables and parameters. eg. You have given a 4-gallon jug and another 3-gallon jug. Neither has measuring marker on it. You have to fill the jugs with water. How can you get exactly 2 gallons of water in to 4 gallons. Here the state space can defined as set of ordered pairs integers(x,y), such that x=0,1,2,3 or 4 and y=0,1,2 or 3; X represents the number of gallons in 4 gallon jug and y represents the quantity of water in the 3-gallon jug.

4 .

Which search implements stack operation for searching the states?

A)

Breadth-first search

B)

Depth-first search

C)

Depth-limited search

D)

None of the above

Correct Answer : Option (B) : Depth-first search

Explanation : It implements stack operation because it always expands the deepest node in the current tree.

5 .

What is Initial state + Goal state in Search Terminology?

A)

Admissibility

B)

Problem Instance

C)

Problem Space

D)

Problem Space Graph

Correct Answer : Option (B) : Problem Instance

Explanation : Problem Instance : It is Initial state + Goal state.

6 .

What is Time Complexity of Breadth First search algorithm?

A)

b^2

B)

b

C)

b^b

D)

b^d

Correct Answer : Option (D) : b^d

Explanation : Time Complexity of Breadth First search algorithm is b^d.

7 .

What is the general term of Blind searching?

A)

Informed Search

B)

Heuristic Search

C)

Uninformed Search

D)

Informed & Unformed Search

Correct Answer : Option (C) : Uninformed Search

Explanation : In case of uninformed search no additional information except the problem definition is given.

8 .

Which of the following is/are Uninformed Search technique/techniques?

A)

Bidirectional Search

B)

Depth First Search (DFS)

C)

Breadth First Search (BFS)

D)

All of the above

Correct Answer : Option (D) : All of the above

Explanation : Several uninformed search techniques includes BFS, DFS, Uniform-cost, Depth-limited, Bidirectional search etc.

9 .

What is the other name of informed search strategy?

A)

Heuristic search

B)

Simple search

C)

Online search

D)

None of the above

Correct Answer : Option (A) : Heuristic search

10 .

A heuristic is a way of trying ______

A)

To discover something or an idea embedded in a program

B)

To compare two nodes in a search tree to see if one is better than another

C)

To search and measure how far a node in a search tree seems to be from a goal

D)

All of the above

Correct Answer : Option (D) : All of the above

Explanation : In a heuristic approach, we discover certain idea and use heuristic functions to search for a goal and predicates to compare nodes.