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.
List the areas in that data structures are applied extensively?
Elucidate the terms Run-Time Stack, Binding Time, Recursive case, Base case and Tail Recursion?
What are the different between quick and merge sort algorithms?
What is the relation between Doubly Linked List and Circular Linked List?
What is the application of tree data-structure?
Describe in brief the word Quick Sort?
Illustrated out briefly the term array. And also write down the types of array operations?
Briefly explain the term binary tree? Elucidate its uses?
Explain whether the fact table is in normal form or not?
Explain about the threaded binary tree and its common uses.
18,76,764
1922328 Asked
3,689
Active Tutors
1442944
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!