Describe BFS and DFS
Write down the difference between BFS and DFS?
Expert
BFS: This can be thought of as being such as Dijkstra's algorithm for shortest paths, however with each and every edge containing the same length. Though it is a lot simpler and does not require any data structures. We just keep a tree (that is, the breadth first search tree), a list of nodes to be added to tree and markings (Boolean variables) on the vertices to tell whether they are in the tree or list.
Depth first search is the other way of traversing graphs, which is closely associated to preorder traversal of a tree. Remember that preorder traversal just visits each node before its children. It is most simple to program as a recursive routine.
Give a brief description of the term binary searching and Fibonacci search?
Give a brief description of the term Merge Sort?
Define the term threaded binary tree. Describe its common uses.
State the difference between the Stack and Array?
Explain the difference between a stack and a Queue.
Explain the queue operation in brief.
Which is the easiest sorting method to use?
Write down the differentiation between STACK and ARRAY?
What are the main uses of data structures?
18,76,764
1941644 Asked
3,689
Active Tutors
1452396
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!