Question 1
How does UCS handle loops?
Question 2
What is the advantage of UCS over BFS and DFS?
Question 3
What kind of strategy should be used for complex problems instead of blind search strategies?
Question 4
In DFS, what happens if cycles are present in the graph?
Question 5
For which type of problems would it be advisable to avoid blind search strategies?
Question 6
How does BFS traverse nodes in a graph?
Question 7
In Depth First Search (DFS), what does the algorithm do when it reaches the deepest node in a branch?
Question 8
In the UCS example provided, what was the optimal path cost from node S to G?
Question 9
What is an example of a situation where DFS might take a long time?
Question 10
Which search algorithm uses a priority queue?
Question 11
Which search algorithm is suitable if there are space restrictions and multiple solutions?
Question 12
In the DFS example, the path was S → A → G with an expansion of how many nodes?
Question 13
Which search algorithm is known for having potential high computational complexity?
Question 14
What is a significant weakness of DFS?
Question 15
What data structure does Breadth First Search (BFS) use to traverse the graph?