Question
In a _________ search, we begin search at a starting node, and when we come across a dead end then we backtrack.
The correct answer is
Depth first
Search Strategy: Backtracking Explained
The question describes a search method that starts exploring from a starting node. If it reaches a point where it cannot proceed further (a dead end), it goes back up the path it took (backtracks) to find an alternative route.
This behaviour is characteristic of Depth First Search (DFS). DFS explores as far as possible along each branch before backtracking.
- Depth First Search: Explores deeply into a branch before exploring other branches. It uses backtracking effectively when a path leads to a dead end.
- Breadth First Search: Explores neighbours level by level, not by backtracking from dead ends in the same manner.
Therefore, the search that begins at a starting node and backtracks upon hitting a dead end is a Depth First search.
Was this answer helpful?
Important Questions from Miscellaneous
- Which of the following scheduler/schedulers is/are also called CPU scheduler ?
(A). Short Term Scheduler
(B). Long Term Scheduler
(C). Medium Term Scheduler
(D). Asymmetric Scheduler
Choose the correct answer from the options given below: - A situation where two or more processes are blocked, waiting for resources held by each other is called:
- External fragmentation occurs ________.
- Which disk scheduling algorithm looks for the track closest to the current head position?
- Which CPU scheduling algorithm prefers the process with the shortest burst time?
Need Expert Advice?
