COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
GPS navigation
|
|
|
Peer to Peer network
|
|
|
Finding bipartiteness of a graph
|
|
|
Finding shortest path between two nodes
|
Detailed explanation-1: -Which of the following is not an application of Breadth First Search? Explanation: Breadth First Search can be applied to Bipartite a graph, to find the shortest path between two nodes, in GPS Navigation. In Path finding, Depth First Search is used.
Detailed explanation-2: -The correct answer is option 3: ‘Finding diameter of the graph’ and ‘Finding bipartite graph’ are the application of Breath First Search (BFS) on the graph.
Detailed explanation-3: -Using GPS navigation system BFS is used to find neighboring places. In networking, when we want to broadcast some packets, we use the BFS algorithm. Path finding algorithm is based on BFS or DFS. BFS is used in Ford-Fulkerson algorithm to find maximum flow in a network.
Detailed explanation-4: -BFS doesn’t calculate shortest path between every pair. BFS computes shortest path between source vertex (w) to every vertex in the graph. BFS doesn’t calculate shortest path between any two vertices.