Question 8 – ISRO-2018
February 13, 2024Question 10 – ISRO-2018
February 13, 2024Question 9 – ISRO-2018
Which of the following is application of Breadth First Search on the graph?
Correct Answer: C
Question 8 Explanation:
Breadth-first search can be used to solve many problems in graph theory
Examples
1. Copying garbage collection, Cheney’s algorithm
2. Find the diameter of the graph
3. Testing bipartiteness of a graph.
4. Finding the shortest path between two nodes u and v, with path length measured by the number of edges (an advantage over depth-first search)
5. (Reverse) Cuthill–McKee mesh numbering
6. Ford–Fulkerson method for computing the maximum flow in a flow network
7. Serialization/Deserialization of a binary tree vs serialization in sorted order, allows the tree to be reconstructed in an efficient manner.
8. Construction of the failure function of the Aho-Corasick pattern matcher.
Finding the diameter of the graph
Finding the bipartite graph
Both (a) and (b)
None of the above
Subscribe
Login
0 Comments