Explore topic-wise MCQs in Artificial Intelligence.

This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.

1.

The complexity of minimax algorithm is$

A. Same as of DFS
B. Space – bm and time – bm
C. Time – bm and space – bm
D. Same as BFS
Answer» B. Space ‚Äö√Ñ√∂‚àö√ë‚àö¬® bm and time ‚Äö√Ñ√∂‚àö√ë‚àö¬® bm
2.

General algorithm applied on game tree for making decision of win/lose is ___________?

A. DFS/BFS Search Algorithms
B. Heuristic Search Algorithms
C. Greedy Search Algorithms
D. MIN/MAX Algorithms
Answer» E.
3.

The initial state and the legal moves for each side define the __________ for the game.

A. Search Tree
B. Game Tree
C. State Space Search
D. Forest
Answer» C. State Space Search
4.

A game can be formally defined as a kind of search problem with the following components:

A. Initial State
B. Successor Function
C. Terminal Test
D. All of the mentioned
Answer» E.
5.

Zero sum game has to be a ______ game.

A. Single player
B. Two player
C. Multiplayer
D. Three player
Answer» D. Three player
6.

Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.

A. True
B. False
Answer» C.
7.

Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive.$

A. True
B. False
Answer» B. False
8.

Adversarial search problems uses

A. Competitive Environment
B. Cooperative Environment
C. Neither Competitive nor Cooperative Environment
D. Only Competitive and Cooperative Environment
Answer» B. Cooperative Environment
9.

General games involves

A. Single-agent
B. Multi-agent
C. Neither Single-agent nor Multi-agent
D. Only Single-agent and Multi-agent
Answer» E.