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.
Write down the differentiation between STACK and ARRAY?
Illustrates the disadvantages of circular linked list over linear linked list?
Define the fastest sorting method to use?
What do you mean by the term matrix? Describe its uses with an illustration.
What is the relation between Doubly Linked List and Circular Linked List?
Define testing?
What are the differences between Recursive Case and Tail Recursion?
Illustrates the use of semaphores for the critical sections of a task?
Explain about the term database Trigger.
Write down the prerequisites for implementing the queue ADT by using array?
18,76,764
1944691 Asked
3,689
Active Tutors
1412116
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!