Sunday, 29 October 2017

Question Bank of Data Structure: Set 5

Q.1 What is the average number of comparisons in a sequential search?
Q.2 Sort the following list using Heap Sort technique, displaying each step. 20, 12, 25 6, 10, 15, 13
Q.3 When will you sort an array of pointers to list elements, rather than sorting the elements themselves? 
Q.4 What do you mean by hash clash? 
Q.5 Define Hashing. How do collisions happen during hashing? 
Q.6 Which sorting algorithm is best if the list is already sorted? Why?
Q.7 Sort the following sequence of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55
Q.8 Draw a B-tree of order 3 for the following sequence of keys: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10
Q.9 What is quick sort? Sort the following array using quick sort method. 24 56 47 35 10 90 82 31
Q.10 How many key comparisons and assignments an insertion sort makes in its worst case?
Q.11 Create a heap with following list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12
Q.12 Describe insertion sort with a proper algorithm. What is the complexity of insertion sort in the worst case?
Q.13 Why do we use a symptotic notation in the study of algorithm? 
Q.14 How will you represent a max-heap sequentially? Explain with an example.
Q.15 Write an algorithm to insert an element to a max-heap that is represented sequentially.
Q.16 What do you mean by hashing? Explain any five popular hash functions.
Q.17 What is the best case complexity of quick sort and outline why it is so. How could its worst case behavior arise?
Q.18 Describe commonly used asymptotic notations and give their significance.
Q.19 Explain the different techniques resolving of collision.
Q.20 Explain in detail any one method to resolve hash collisions.

Mukesh Rajput

No comments:

Post a Comment

Mukesh Rajput