Artificial Intelligence MCQs

 1) A ____________ approach involves a combination of mathematics and engineering.

A)Turing Test B)cognitive modelling C)agent D) rationalist

Correct Ans: rationalist

2) The first operational programmable computer was the ___________, the invention of Konrad Zuse in Germany in 1941.

A) Z-2 B)Z-3 C)Z-4 D)Z-5

Correct Ans: Z-3

3) An agent perceive environment through sensors and acting upon that environment through ____________.

A)effectors B) Devices C) Operation D) None of these

Correct Ans: effectors

4) If there are a limited number of distinct, clearly defined percepts and actions we say that the environment is __________.

A)episodic B)static C)discrete D)continuous

Correct Ans: discrete

5) The environment of the problem is represented by a _________.

A)path B)problem C)goal test D)state space

Correct Ans: state space

6) ___________ search calls depth-limited search with increasing limits until a goal is found.

A)Iterative deepening B)Depth-first C)Breadth-first D)Bidirectional

Correct Ans: Iterative deepening

7) A ______________ is an area of the state space where the evaluation function is essentially flat.

A)minima B)Ridges C)maxima D)plateau

Correct Ans: plateau

8) ______________ provides a way to escape local maxima, and is complete and optimal given a long enough cooling schedule.

A)A* search B)Simulated annealing C)SMA* D)greedy search

Correct Ans: Simulated annealing

9) Decision trees are an efficient method for learning ___________ Boolean functions.

A) stochestic B) non deterministic C)deterministic D)None of these

Correct Ans: deterministic

10) The last component of the learning agent is the _______________.

A)learning goals B)learning element C)problem generator D)critic

Correct Ans: problem generator

11) A ____________ takes as input an object or situation described by a set of properties, and outputs a yes/no "decision."

A)binary tree B)decision tree C)search tree D)learning algorithm

Correct Ans: decision tree

12) The human brain is composed of billions of nerve cells called __________.

A)neurons B)cells C)nodes D)units

Correct Ans: neurons

13) In __________ without checking each node of the game tree we can compute the correct minimax decision.

A)pruning B)Greedy approach C)backtracking D) Huristic

Correct Ans: pruning

14) ____________ it starts from the root node and follows each path to its greatest depth node before moving to the next path.

A)DFS B)BFS C)Bidirectional search D)DLS

Correct Ans: DFS

15) __________ reasoning is deducing new information from logically related known information.

A)Common Sense B) Abductive C)Deductive D)Inductive

Correct Ans: Deductive