Consider the search tree shown in the following figure, in which the dark node r
ID: 3645136 • Letter: C
Question
Consider the search tree shown in the following figure, in which the dark node
represents the solution.
(a) If a sequential searchof the tree is performed using the standarddepth-first search (DFS) algorithm, how much time does it take to find the solution if traversing each arc of the tree takes one unit of time? Note: DFS begins by expanding the initial node and generating its successors. In each subsequent step, DFS expands one of the most recently generated nodes. If this node has no successors (or cannot lead to any solutions), then DFS backtracks and expands a different node.
(b) Assume that the tree is partitioned between two processing elements that are assigned to do the search job, as shown in figure b. If both processing elements perform a DFS on their respectivehalves of the tree, how much time doesit take for the solutionto be found? What is the speedup?Is it a linear, sublinear, or superlinear speedup?
Explanation / Answer
a)the time that will take to search it depends on the tree B)it takes the less time than the tree A............speed up defines speeding up the action to search the desired node................it is linear speed up