Podcast
Questions and Answers
Breadth-first search is optimal for any possible step costs.
Breadth-first search is optimal for any possible step costs.
False
A complete algorithm is guaranteed to find a solution if it exists.
A complete algorithm is guaranteed to find a solution if it exists.
True
Breadth-first search typically uses as LIFO-queue.
Breadth-first search typically uses as LIFO-queue.
False
An optimal search algorithm is guaranteed to find a solution with maximum cost.
An optimal search algorithm is guaranteed to find a solution with maximum cost.
Signup and view all the answers
Consider a uniform search tree with a branching factor of 3 and a solution at depth 3 (the depth of a node is the number of edges present on the path from the root node of a tree to that node). What is the largest size of the frontier in a breadth-first search at least?
Consider a uniform search tree with a branching factor of 3 and a solution at depth 3 (the depth of a node is the number of edges present on the path from the root node of a tree to that node). What is the largest size of the frontier in a breadth-first search at least?
Signup and view all the answers
Which of the following information do we need to store for each node in a search tree?
Which of the following information do we need to store for each node in a search tree?
Signup and view all the answers
Which of the following properties of a search problem are commonly used to characterize the time/space complexity of search algorithms?
Which of the following properties of a search problem are commonly used to characterize the time/space complexity of search algorithms?
Signup and view all the answers
Consider breadth-first search for a route-finding problem given by the following graph. Assume that the initial state is In(Sibiu) and the goal state is In(Bucharest). What is the cost of the solution returned by breadth-first search?
Consider breadth-first search for a route-finding problem given by the following graph. Assume that the initial state is In(Sibiu) and the goal state is In(Bucharest). What is the cost of the solution returned by breadth-first search?
Signup and view all the answers
Consider the following route-finding problem. Consider a solution from Arad to Bucharest via the path (Arad - Zerind - Oradea - Sibiu - Fagaras - Bucharest). What is the corresponding path cost?
Consider the following route-finding problem. Consider a solution from Arad to Bucharest via the path (Arad - Zerind - Oradea - Sibiu - Fagaras - Bucharest). What is the corresponding path cost?
Signup and view all the answers
