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.
Describe the term binary tree? Describe its some uses.
Define the term data structure? Describe the types of data structures?
Determine the sequential search and the average number of comparisons in a sequential search.
Write down a brief note on the term recursive algorithm?
Write down some of the limitations of arrays?
Define the term a spanning Tree.
Write down the differentiation between STACK and ARRAY?
Illustrates the stack operation in briefly?
Illustrated out briefly the term array. And also write down the types of array operations?
Briefly describe the term merge sort algorithm?
18,76,764
1947354 Asked
3,689
Active Tutors
1449312
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!