WorksheetsQuiz 2 - Search
Total questions: 12
Worksheet time: 7mins
The N-Queen problem is solved using a state space where each state represents a partial arrangement of queens, and the goal is to place _ queens on an _*_ chessboard so that no two queens attack each other.
(a)
In a search tree, a_ is a data structure representing a state in the problem space, while the _ represents the path from the initial state to the goal state.
(a)
The time complexity of Breadth-First Search (BFS) in terms of branching factor b and depth d isO(_) , while its space complexity is _.
bd, bd
db , bd
bd, bd
bd , db
In the Water-Jug problem, the state space consists of:
All possible sequences of pouring water
All possible configurations of water levels in the jugs
Only the goal state and initial state
Only the transitions between states
The N-Queen problem is solved using which of the following techniques?
a) Backtracking
b) Hill Climbing
c) Both a and b
d) None of the above
In a search tree, a node that has not yet been expanded is placed in the:
Open List
Closed List
Goal List
None of the above
Breadth-First Search (BFS) is guaranteed to find:
Any solution
The shallowest solution
The least-cost solution
The fastest solution
Which of the following search strategies is uninformed?
A* Search
Greedy Best-First Search
Iterative Deepening Depth-First Search (IDDFS)
Hill Climbing
Uniform Cost Search selects the node with:
The highest heuristic value
The lowest cost from the initial state
The deepest depth in the search tree
The most promising heuristic estimate
The Greedy Best-First Search algorithm uses which function for evaluation?
f(n)=g(n)+h(n)
f(n)=h(n)
f(n)=g(n)
f(n)=h(n)−g(n)
A* Algorithm is guaranteed to be optimal if the heuristic function is:
a) Admissible
b) Consistent
c) Both a and b
d) Neither a nor b
A heuristic function is consistent if:
a) It never overestimates the actual cost to reach the goal
b) It satisfies the triangle inequality
c) It always provides a unique path to the goal
d) It ensures the search is complete
