1. Aristotle was one of the firsts to attempt to codify “thinking”. His _________ provided patterns of argument structure that always gave correct conclusions, given correct premises.

A. deductions
B. formalism
C. syllogisms
D. axioms

Answer :- c

2. The _____________ developed in 1957 by Alan Newell and Herbert Simon, embodied a grandiose vision: a single computer program that could solve any problem.

A. General Problem Solver
B. Imitation Game
C. Logic Theorist
D. Enigma Machine

Answer :- a

3. Of the different dimensions of Artificial Intelligence, “Think Rationally” is to

A. Model human cognition.
B. Formalize the inference process.
C. Do the right thing.
D. Exhibit human behaviour.

Answer :- b

4. Selecting rules and keeping track of those sequences of rules already tried constitute what we call the ____________ for production systems.

A. Goal Stack
B. Control Strategy
C. Inference Engine
D. Database

Answer :- b

5. Assertion A: AI Production System with informed control system have high control strategy cost.
Reason R: At the informed extreme, the control strategy is guided by information about the problem domain, incurs cost in terms of storage and computation.

Mark the correct choice as

A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A
C. A is True but R is False
D. A is false but R is True

Answer :- a

6. _________ aims at building machines that act intelligently, without taking a position on whether or not the machines actually are intelligent.

A. Weak AI
B. Strong AII
C. Connectionist AI
D. Symbolic A

Answer :- a

7. Domain knowledge is used to make preferential choice between the child nodes in ________

A. Depth First Search
B. Breadth First Search
C. Heuristic Search
D. Depth Limited Search

Answer :- c

8. For more complex games, such as chess or checker the AND/OR search to termination is out of question. Which of the following statements are true?
I. Our goal in searching such a game tree might be, instead, merely to find a good first move.
II. Extract from the search graph an estimate of the ‘best’ first move.

A. Both I and II.
B. Only II
C. Only I
D. Both I and II are false.

Answer :- a

9. The AO* algorithm can best be seen as the following TWO major operations:

A. Step I: Top-down: graph-growing; Step II: Bottom-up: cost-revising, SOLVE-labelling.
B. Step I: Bottom-up: graph-growing; Step II: Top-down: cost-revising, SOLVE-labelling.
C. Step I: Top-down: graph-growing, SOLVE-labelling; Step II: Bottom-up: cost-revising.
D. Step I: Bottom-up: graph-growing, SOLVE-labelling; Step II: Top-down: cost-revising.

Answer :- a

10. The ___________ is a way of combining the advantages of both depth-first and breadth- first search into a single method.

A. Iterative Deepening Depth First Search
B. Bidirectional Search
C. Best First Search.
D. Depth Limited Search

Answer :- c