27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
28. Of the following tree structure, which is, efficient considering space and time complexities?
(a) Incomplete Binary Tree
(b) Complete Binary Tree
(c) Full Binary Tree
(b) Complete Binary Tree.
By the method of elimination:
Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.
29. What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.
30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
No.
Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
32. Which is the simplest file structure?
(a) Sequential
(b) Indexed
(c) Random
(a) Sequential
33. Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one.
What is a data structure?
What does abstract data type means?
Evaluate the following prefix expression ” ++ 26 + – 1324″ (Similar types can be asked)
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked)
How is it possible to insert different type of elements in stack?
Stack can be described as a pointer. Explain.
Write a Binary Search program
Write programs for Bubble Sort, Quick sort
Explain about the types of linked lists
How would you sort a linked list?
Write the programs for Linked List (Insertion and Deletion) operations
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
Explain binary searching, Fibinocci search.
What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)
How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3?
A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute?
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered?
What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest?
Which sort show the best average behavior?
What is the average number of comparisons in a sequential search?
Which data structure is needed to convert infix notations to post fix notations?