18CSC305J-Artificial Intelligence

18CSC305J - Artificial Intelligence

Unit II
QUESTION BANK
MCQ QUESTIONS
# Question Answer
Which search is implemented with an empty first-in-first-out
queue?

1 A. Depth-first search B
B. Breadth-first search
C. Bidirectional search
D. None of the mentioned
What is the other name of informed search strategy?

A. Simple search
2 B
B. Heuristic search
C. Online search
D. None of the mentioned
A* algorithm is based on ____

A. Breadth-First-Search
3 D
B. Depth-First-Search
C. Uniform Cost Search
D. Best-First-Search
Strategies that know whether one non-goal state is “more
promising” than another are called

4 A. Informed & Unformed Search D

B. Unformed Search
C. Heuristic & Unformed Search
D. Informed & Heuristic Search

Question Bank – VDP – UNIT2 1

18CSC305J-Artificial Intelligence

Which of the following algorithms keeps track of ‘k’ states instead

of just one?

A. Hill-Climbing search
5 B
B. Local Beam search
C. Stochastic hill-climbing search
D. Random restart hill-climbing search
E. None of these
A common assumption about the players in a game is that

A. Neither player knows the payoff matrix.

6 B. The players have different information about the payoff matrix. D
C. Only one of the players pursues a rational strategy.
D. The specific identity of the players is irrelevant to the play of
the game.
Which search implements stack operation for searching the
states?

7 A. Depth-limited search B
B. Depth-first search
C. Breadth-first search
D. None of the mentioned
Though local search algorithms are not systematic, key
advantages would include ____

8 A. Less memory D
B. More time
C. Finds a solution in large infinite space
D. Less memory & Finds a solution in large infinite space
Uninformed search strategies are better than informed search
strategies.
9 A
A. True
B. False

Question Bank – VDP – UNIT2 2

18CSC305J-Artificial Intelligence

The _______ is a touring problem in which each city must be

visited exactly once. The aim is to find the shortest tour.

A. Finding shortest path between a source and a destination

10 B
B. Travelling Salesman problem
C. Map coloring problem
D. Depth first search traversal on a given map represented as a
graph
When is breadth-first search optimal?

A. When there is less number of nodes

11 B
B. When all step costs are equal
C. When all step costs are unequal
D. Both a & c
When will Hill-Climbing algorithm terminate?

A. Stopping criterion met

12 C
B. Global Min/Max is achieved
C. No neighbor has higher value
D. All of the above
Is optimality and completeness exists in bidirectional search
algorithm?

13 A. Yes, Yes A
B. No, Yes
C. Yes, No
D. No, No
Best-First search is a type of informed search, which uses _______
to choose the best next node for expansion.

14 A. Evaluation function returning lowest evaluation A

B. Evaluation function returning highest evaluation
C. Evaluation function returning lowest & highest evaluation
D. None of them is applicable

Question Bank – VDP – UNIT2 3

18CSC305J-Artificial Intelligence

Which search is equal to minimax search but eliminates the

branches that can’t influence the final decision?

15 A. Depth-first search C
B. Breadth-first search
C. Alpha-beta pruning
D. None of the above
Which values are independent in minimax search algorithm?

A. Pruned leaves x and y

16 A
B. Every states are dependent
C. Root is independent
D. None of the above
For general graph, how one can get rid of repeated states?

A. By maintaining a list of visited vertices

17 A
B. By maintaining a list of traversed edges
C. By maintaining a list of non-visited vertices
D. By maintaining a list of non-traversed edges
DFS is ______ efficient and BFS is __________ efficient.

A. Space, Time
18 A
B. Time, Space
C. Time, Time
D. Space, Space
Which of the following are the two key characteristics of the
Genetic Algorithm?

A. Crossover techniques and Fitness function

19 A
B. Random mutation and Crossover techniques
C. Random mutation and Individuals among the population
D. Random mutation and Fitness function
E. None of these

Question Bank – VDP – UNIT2 4

18CSC305J-Artificial Intelligence

Hill-Climbing technique stuck for which of the following reasons?

A. Local maxima
20 B. Ridges D
C. Plateaux
D. All of these
E. None of these
How many successors are generated in backtracking search?

A. 1
21 A
B. 2
C. 3
D. 4
Which value is assigned to alpha and beta in the alpha-beta
pruning?

22 A. alpha = max D
B. alpha = min
C. beta = min
D. Both A and C
Which of the mentioned properties of heuristic search
differentiates it from other searches?

A. It provides solution in a reasonable time frame

23 B. It provides the reasonably accurate direction to a goal D
C. It considers both actual costs that it took to reach the current
state and approximate cost it would take to reach the goal from
the current state
D. All of the above
What is most important to be concerned with in the evolution of
repetitive
problems?
24 C
A. Do multiple runs until a good solution is found
B. Execute one run until the solution is good enough
C. Get a reasonably good solution every time
D. Get a very good result just once

Question Bank – VDP – UNIT2 5

18CSC305J-Artificial Intelligence

General algorithm applied on game tree for making decision on

win/lose is

25 A. DFS/BFS search algorithm D

B. Heuristic search algorithm
C. Greedy search algorithm
D. Minmax algorithm
Which one of the following is a part of every game theory model?

A. Players.
26 D
B. Payoffs
C. Probabilities
D. Strategies
Which of the following describes Nash equilibrium?

A. A firm chooses its dominant strategy, if one exists.

27 B. Every competing firm in an industry chooses a strategy that is B
optimal given the choices of every other firm.
C. Market price results in neither a surplus nor a shortage.
D. All firms in an industry are earning zero economic profits.
A prisoners' dilemma is a game with all of the following
characteristics except one.

A. Players cooperate in arriving at their strategies.

28 B. Both players have a dominant strategy. A
C. Both players would be better off if neither chose their
dominant strategy.
D. The payoff from a strategy depends on the choice made by the
other player.
The heuristic path algorithm is a best-first search in which the
evaluation function is
f(n) = (2 − w)g(n) + wh(n). What kind of search does this perform
for w = 1?
29 B
A. Uniform cost search
B. A* search
C. Greedy best-first search

Question Bank – VDP – UNIT2 6

18CSC305J-Artificial Intelligence

D. None of the above

A genetic algorithm (or GA) is a variant of stochastic beam search

in which successor states are generated by combining two parent
states, rather than by modifying a single state.
30 A
A. True
B. False
Adversarial search problems uses ____________

a) Competitive Environment
b) Cooperative Environment
31
c) Neither Competitive nor Cooperative Environment
d) Only Competitive and Cooperative Environment Answer : a

Zero sum game has to be a ______ game.

a) Single player
b) Two player
32 c) Multiplayer c
d) Three player

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

____________
a) DFS/BFS Search Algorithms
33 d
b) Heuristic Search Algorithms
c) Greedy Search Algorithms
d) MIN/MAX Algorithms

What is the complexity of minimax algorithm?

a) Same as of DFS
34 a
b) Space – bm and time – bm
c) Time – bm and space – bm
d) Same as BFS

Question Bank – VDP – UNIT2 7

18CSC305J-Artificial Intelligence

Which of the following for the game can be defined by the initial state and
the legal moves for each side?
(A). Search Tree
(B). Forest
35 (C). State Space Search D
(D). Game Tree
(E). Goal State

DESCRIPTIVE QUESTIONS

1.Differentiate Blind Search and Heuristic Search.

2.Explain Uniform Cost Search Algorithm with an example.

3.Brief Generate and Test Strategy.

4.Explain Travelling Salesman Problem with an example.

5.Brief the parameters for evaluating Search Algorithms .

6.Illustrate any local search algorithm.

7.What are the disadvantages of Hill climbing Algorithm and how can you
overcome it ?

8. Sketch the basic steps in Simulated Annealing .

9. List the basic genetic operators .

10. What do you understand by adversarial search ?

11. What is pruning ?

12.Brief the elements of game playing search.

13. Define Maximin Strategy.

14.List the limitations of Minmax algorithm.

Question Bank – VDP – UNIT2 8

18CSC305J-Artificial Intelligence

15. What is Alpha Beta Pruning.

16. Define Zero-Sum Game.

17. Brief the assumptions underlying game theory.

18.What is the significance of saddle point ?

19. What is pure strategy game ?

20. What is mixed strategy game ?

21. Solve the following mixed strategy game.

Y1 Y2

X1 4 2
X2 0 10

22.Illustrate Prisoner’s Dilemma in the context of game theory.

23. What is Nash equilibrium ?

24. Explain Alpha Beta Pruning in detail with an appropriate example.

Question Bank – VDP – UNIT2 9

18CSC305J-Artificial Intelligence

25. What is Game Theory ?

26. What do you understand by Dominance property in a Two-person zero-sum

game ?

27.Brief Expected Gain and Loss Method.

28.List the parameters for pruning .

29. Bring out the effect of Alpha beta cut off over minimax.

30. What are the various auction strategies available as part of mechanism
design?

Question Bank – VDP – UNIT2 10

18CSC305J-Artificial Intelligence

31. A professional athlete , Biff Rhino , and his agent , Jim Fence , are
renegotiating Biff’s contract with the general manager of the Texas Buffaloes ,
Harry Sligo . The various outcomes of this game situation is organized into a
payoff table as shown below.

General Manager Strategy

Athlete/Agent
Strategy A B C
1 $50,000 $35,000 $30,000
2 60,000 40,000 20,000

The athlete and agent want to maximize the athlete’s contract , and the general
manager hopes to minimize the athlete’s contract . Using maximin and minimax
strategies work out the optimal strategy for athlete as well as the general
manager . Does this game situation have a saddle point ? Substantiate your
answers with appropriate reasoning .

32. The Coloroid Camera Company (referred to as company I) is going to

introduce a new camera into its product line and hopes to capture as large an
increase in its market share as possible. In contrast, the Camco Camera Company
(referred to as company II) hopes to minimize Coloroid’s market share increase.
Coloroid and Camco dominate the camera market, and any gain in market share
for Coloroid will result in a subsequent identical loss in market share for Camco.
The strategies for each company are based on their promotional campaigns,
packaging, and cosmetic differences between the products. The payoff table,
which includes the strategies and outcomes for each company (I Coloroid and II
Camco), is shown below. The values in the table are the percentage increases or
decreases in market share for company I.

Company Company II Strategy

I
Strategy A B C
1 9 7 2

Question Bank – VDP – UNIT2 11

18CSC305J-Artificial Intelligence

2 11 8 4
3 4 1 7

Apply Maximin decision criteria and Minimax criteria and check whether the two
strategies result in an equilibrium point . Identify dominant strategies and
eliminate them .

33).Check for dominant strategies in the given payoff matrices . Also check
whether Nash equilibriums exists for the given situation. Can a problem have
more than one nash equilibrium ?

(i)

A L R

U 7,6 5,5

D 4,5 6,4

(ii)

COKE

L R

U 6,8 4,7
PEPSI
D 7,6 3,7

Question Bank – VDP – UNIT2 12

18CSC305J-Artificial Intelligence

34) Given the following search tree, apply the alpha-beta pruning algorithm to it
and show the search tree that would be built by this algorithm. Make sure that
you show where the alpha and beta cuts are applied and which parts of the
search tree are pruned as a result.

B
C

D E F G

H I J K L M N O

6 5 8 10 2 1 15 18

Question Bank – VDP – UNIT2 13