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.
Explain about the spanning Tree?
Explain the difference between a stack and a Queue.
Explain about the direct call to ISR by an interrupting source.
Describe in brief the word Merge Sort?
Describe the term binary tree? Describe its some uses.
Briefly describe the term linear and non linear data structure?
What are the differences between data structure of System R and the relational structure?
Define when we should use plain list.
Illustrate the difference between the stack and Queue in brief?
Write the goals of Data Structure?
18,76,764
1951409 Asked
3,689
Active Tutors
1440561
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!