NEW
Font size
WorksheetsSearch Algorithms Quiz
Total questions: 25
Worksheet time: 25mins
In which search strategy is the shallowest node expanded first?
Depth First Search
Breadth First Search
Hill Climbing
A* Search
Which of the following is NOT an example of uninformed search?
Breadth First Search
Depth First Search
Hill Climbing
Uniform Cost Search
Which of these search algorithms uses a heuristic function to guide the search?
Breadth First Search
Depth First Search
Hill Climbing
Depth Limited Search
The A* algorithm uses which two components to evaluate nodes?
Cost and depth
Path cost and heuristic cost
Breadth and depth
Step cost only
What is the primary disadvantage of depth first search?
May find sub-optimal solution
High space requirement
Needs heuristic function
Cannot be used in trees
Which search algorithm is guaranteed to find the optimal solution if the heuristic is admissible?
Hill Climbing
A* Search
Depth First Search
Breadth First Search
What is the main challenge in heuristic search?
Using too little memory
Defining a suitable heuristic
Infinite loops
Large step costs
The Hill Climbing algorithm can get stuck at which points?
Local maxima
Goal node
Heuristic minima
Both a and c
Which algorithm is best suited when solution spaces are AND/OR graphs?
A* algorithm
AO* algorithm
BFS
Hill climbing
In adversarial search, which algorithm is commonly used in two-player games?
A*
Mini-max
AO*
Hill climbing
What is the purpose of alpha-beta pruning in game trees?
To learn heuristics
To reduce the number of nodes evaluated by the minimax algorithm
To solve AND/OR graphs
To sort game moves
Which property is desirable for heuristic functions in A* search?
Overestimating actual cost
Underestimating actual cost
Being constant
Infinite values
In problem reduction, a problem is broken down into:
ASTs
Sub-problems
Games
States
Which of the following searches is uninformed?
A* search
Best-first search
Breadth First Search
Hill climbing
In game playing, an evaluation function is used to:
Expand nodes
Estimate board value
Prune nodes
Learn opponent strategies
The major drawback of alpha-beta pruning is:
It finds sub-optimal solutions
It cannot be used with minimax
It requires good move ordering for maximum benefit
It increases tree size
Which algorithm is specifically designed to handle graphs with AND and OR nodes?
Mini-max
AO*
BFS
DFS
Which of the following is NOT a property of breadth-first search?
Completeness
Optimality
Large memory requirements
Fastest search
How does depth first search traverse a tree?
It explores as far as possible down one branch before backtracking
It visits all siblings before children
It only explores breadth
It always finds the shortest path
Hill climbing fails when:
Heuristic increases
It reaches a local optimum
Path cost increases
Node degree is high
What is the main idea of minimax algorithm in game playing?
Minimize time complexity
Minimize the possible loss
Maximize node expansions
Prune invalid moves
Which search algorithm follows the "best-first" strategy?
BFS
A* search
Uniform Cost Search
DFS
"Evaluation function" in games is typically used when:
Full search to terminal state is infeasible
Applying BFS
Applying DFS
Solving AND/OR graphs
What is the main difference between DFS and BFS?
DFS uses a queue, BFS a stack
BFS uses a queue, DFS a stack
BFS requires heuristic
DFS finds optimal path
The main problem in game playing algorithms is:
State space explosion
No heuristic available
Cannot prune nodes
Always terminates early
