COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
List
|
|
|
Set
|
|
|
Queue
|
|
|
Stack
|
Detailed explanation-1: -Detailed Solution. Breadth First Search uses a queue (First In First Out) and Depth first search uses a stack (First In Last Out).
Detailed explanation-2: -Which of the following data structure is useful in traversing a given graph by breadth first search? (D) None of the above. Explanation: BFS performs level-order traversal which can be fairly done using a queue.
Detailed explanation-3: -Breadth-First Search is based on level order traversal. The queue is used to store nodes in the BFS of any graph. Hence the correct answer is “option 3".
Detailed explanation-4: -Depth First Search (DFS) uses Stack data structure. DFS uses backtracking technique. Remember backtracking can proceed by Stack. Breadth First Search (BFS) algorithm traverses a graph in a breadthwise manner and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration.
Detailed explanation-5: -4. The Breadth First Search traversal of a graph will result into? Explanation: The Breadth First Search will make a graph which don’t have back edges (a tree) which is known as Breadth First Tree.