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 how spiral model works?
Briefly describe the term priority queues?
Explain the terms: physical data independence logical data independence
Describes the bubble sort algorithm?
Describe the terms Base case, Binding Time, Recursive case, Run-Time Stack and Tail Recursion.
Explain how the Doubly Linked List associated with the Circular Linked List?
Write down the various types of matrix operations?
Specify the actions which are performed when a function is called?
Briefly describe the term Tree database. Elucidate its common uses?
Run Time Memory Allocation is termed as?
18,76,764
1952326 Asked
3,689
Active Tutors
1417164
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!