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

1 .

Where did all the facts are stored to implement store and fetch function?

A)

Datamart

B)

Database

C)

Knowledge base

D)

All of the above

Correct Answer : Option (C) : Knowledge base

Explanation : The simplest way to implement store and fetch functions is to keep all the facts in the knowledge base in one long list.

2 .

Which is a lifted version of modus ponens?

A)

Clauses

B)

Generalized modus ponens

C)

Inference

D)

None of the above

Correct Answer : Option (B) : Generalized modus ponens

Explanation : Generalized modus ponens is a lifted version of modus ponens because it raises modus ponens from propositional to first-order logic.

3 .

Uncertainty arises in the Wumpus world because the agent's sensors give only ________

A)

Partial & Global Information

B)

Partial & local Information

C)

Full & local information

D)

Full & Global information

Correct Answer : Option (B) : Partial & local Information

Explanation : The Wumpus world is a grid of squares surrounded by walls, where each square can contain agents and objects. The agent (you) always starts in the lower left corner, a square that will be labeled [1, 1]. The agent’s task is to find the gold, return to [1, 1] and climb out of the cave. Therefore, uncertainty is there as the agent gives partial and local information only. Global variable are not goal specific problem solving.

4 .

A plan that describe how to take actions in levels of increasing refinement and specificity is ________

A)

Planning

B)

Problem solving

C)

Non-hierarchical plan

D)

Hierarchical plan

Correct Answer : Option (D) : Hierarchical plan

Explanation : A plan that describes how to take actions in levels of increasing refinement and specificity is Hierarchical (e.g., “Do something” becomes the more specific “Go to work,” “Do work,” “Go home.”) Most plans are hierarchical in nature.

5 .

The process by which the brain incrementally orders actions needed to complete a specific task is referred as_________

A)

Partial order planning

B)

Planning problem

C)

Total order planning

D)

Both Planning problem & Partial order planning

Correct Answer : Option (A) : Partial order planning

6 .

Which of the following search belongs to totally ordered plan search?

A)

Breadth-first search

B)

Depth-first search

C)

Forward state-space search

D)

Hill-climbing search

Correct Answer : Option (C) : Forward state-space search

Explanation : Forward and backward state-space search are particular forms of totally ordered plan search.

7 .

Which strategy is used for delaying a choice during search?

A)

First commitment

B)

Least commitment

C)

Both (a) and (b)

D)

None of the above

Correct Answer : Option (B) : Least commitment

Explanation : The general strategy of delaying a choice during search is called the least commitment strategy.

8 .

Which can be adapted for planning algorithms?

A)

Constrained

B)

Most-constrained literal

C)

Most-constrained variable

D)

None of the above

Correct Answer : Option (C) : Most-constrained variable

Explanation : The most-constrained variable heuristic from CSPs can be adapted for planning algorithm and seems to work well.

9 .

What are not present in finish actions?

A)

Effect

B)

Finish

C)

Preconditions

D)

None of the above

Correct Answer : Option (A) : Effect

Explanation : Finish has no effects and has as its preconditions the goal literals of the planning algorithm.

10 .

What are present in the empty plan?

A)

Start

B)

Finish

C)

Modest

D)

Both Start & Finish

Correct Answer : Option (D) : Both Start & Finish

Explanation : The "empty" plan contains just the start and finish actions.