21CSC206T-Artificial Intelligence

21CSC206T - 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

1
21CSC206T-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
Which search implements stack operation for searching the
states?

6 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

7 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.
8 A
A. True
B. False

2
21CSC206T-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

9 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

10 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

11 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?

12 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.

13 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

3
21CSC206T-Artificial Intelligence

Which search is equal to minimax search but eliminates the

branches that can’t influence the final decision?

14 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

15 A
B. Every states are dependent
C. Root is independent
D. None of the above
DFS is efficient and BFS is efficient.

A. Space, Time
16 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

17 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

4
21CSC206T-Artificial Intelligence

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

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

A. 1
19 A
B. 2
C. 3
D. 4
Which of the mentioned properties of heuristic search
differentiates it from other searches?

A. It provides solution in a reasonable time frame

20 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?
21 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

5
21CSC206T-Artificial Intelligence

General algorithm applied on game tree for making decision on

win/lose is

22 A. DFS/BFS search algorithm D

B. Heuristic search algorithm
C. Greedy search algorithm
D. Minmax algorithm
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?
23 B
A. Uniform cost search
B. A* search
C. Greedy best-first search

6
 21CSC206T-Artificial Intelligence

D. None of the above

Sample Part-B Questions

1. Mention the criteria for the evaluation of search strategy.

2. What is informed search?
3. Define Heuristic function, h (n).
4. Differentiate Blind Search and Heuristic Search.
5. Solve the water jug problem using the Breadth-First search technique.
6. Differentiate between Breadth-First and Depth first search techniques
7. List the various search strategies.
8. What is Best First Search?
9. Define Evaluation function, f(n).
10. Define A* search
11. Give the drawback of DFS.
12. What is meant by complexities? Explain it w.r.t. following algorithms.
 1. BFS
 2. DFS
 3. Bidirectional
 4. Uniform Cost
 5. Interactive Deepning

Sample Part-C Questions

1. Explain Uniform Cost Search Algorithm with an example. Brief Generate and Test
Strategy(likewise individual search algorithm may be asked).
2. Explain Travelling Salesman Problem with an example
3. Brief the parameters for evaluating Search Algorithms
4. Write A* algorithm and discuss briefly the various observations
about algorithm
5. Discuss in detail the uninformed search strategies and compare the
analysis of various searches.
6. Explain informed search strategies with an example