Search Flashcards
1
Q
Frontier, Interior, Exterior
A
Interior is root, frontier list of nodes that are generated (reached but not explored) from root. Exterior nodes that haven’t generated. So, frontier separates interior and exterior
2
Q
Three types of frontiers
A
Priority Queue (Best-first search)
FIFO(queue) - BFS
LIFO(stack) - DFS
3
Q
Graphs can have loops where as tree don’t
A
yes. So names as graph search and tree search
4
Q
Only one path from child node to root is called tree search
A
no cycles
5
Q
Use parents pointer to his parent and see if the same node appears in this link. this saves memory of storing all visited nodes
A
This way we can check if there are any loops (cycles)
6
Q
Completeness
A
Reports found when it has node or not found when the node is not there
7
Q
A
