Learning For Everyonea) For generating topological sort of a graph
b) For generating Strongly Connected Components of a directed graph
c) Detecting cycles in the graph
d) Peer to Peer Networks
Depth First Search is used in the Generation of topological sorting, Strongly Connected Components of a directed graph and to detect cycles in the graph. Breadth First Search is used in peer to peer networks to find all neighbourhood nodes.
a) linked list
b) tree
c) stack
d) queue
Stack is used in the standard implementation of depth first search. It is used to store the elements which are to be explored.
a) Pre-order Traversal
b) Post-order Traversal
c) Level-order Traversal
d) In-order Traversal
The Breadth First Search Algorithm searches the nodes on the basis of level. It takes a node (level 0), explores it’s neighbors (level 1) and so on.
a) True
b) False
Best First Search is a searching algorithm used in graphs. It explores it by choosing a node by heuristic evaluation rule. It is used in solving searching for related problems.
a) A*
b) C*
c) D*
d) E*
In computer science A* algorithm is used in graph traversal and path finding. It is a process of node finding in between a path. It is an example of the best first search.
Items per page: