IS ZC361- Data structures and Algorithms Practice Problems on Lecture -2

1. In class a bottom-up method of building a heap was discussed. It is also possible to build a heap top-down. Give an algorithm which does this (Hint: use iteration and `upheap'). In general, is this top-down method better or worse than the bottom-up method? Explain. 2. Give an algorithm for changing the value of an arbitrary element from a heap of size N. Also, determine the worst case time complexity of your algorithm. Describe your algorithm in pseudo-code or in English. You may assume that the position of the element whose value is to be changed is given. 3. Give an algorithm for removing an arbitrary element from a heap of size N. Also, determine the worst case time complexity of your algorithm. Describe your algorithm in pseudo-code or in English. 4. Given an array of N distinct integers, develop an O(n + k log n) algorithm to find the kth largest integer in the array. (Hint: build a heap.) 5. A Professor has the policy of giving A's to the top square-root(n) students of his class, where n is the number of students. The algorithm that he uses to determine the top square-root(n) students is to sorts the list of students by their numerical grade, and then picks the top square-root(n) students from the sorted list. This algorithm has time-complexity O(n logn). Can you suggest a more efficient algorithm that has time-complexity O(n)? Describe your algorithm informally in English and justify its time-complexity. 6. You have a hash table of size m = 11 and two hash functions h1 and h2: h1(x) = (sum of the values of the first and last letters of x) mod m h2(x) = ((value of the last letter) mod (m 1)) +1 where the value of a letter is its position in the alphabet (e.g., value(a)=1,value(b)=2, etc.). Here are some pre-computed hash values: word ape bat bird carp dog hare ibex mud koala stork h1: 6 0 6 7 0 2 0 6 1 8 h2 :6 1 5 7 8 6 10 5 2 2

Draw a picture of the resulting hash table after inserting, in order, the following words: ibex, hare, ape, bat, koala, mud, dog, carp, stork. Highlight cells that are looked at when trying to find bird. Do this for each of the following techniques. a. Chaining with h1 as your hash function. b. Linear probing with h1 as your hash function. c. Double hashing with h1 as your first hash function and h2 as your second hash function. 7. A hash table of size M stores N integer keys. Collisions are handled by chaining and the hash function is h(K) = K mod M. a. What is the worst-case search time? Give an example of a set of keys that achieves the worst-case search time. b. Would you use this hash table for a time-critical application (e.g., air-traffic control)? 8. Demonstrate the insertion of the keys 5, 28, 19, 15, 20, 33, 12, 17 into a hash table with collisions resolved by linear probing. Assume that the table has 9 slots and that the hash function is h(k) = k mod 9. Draw the state of the hash table after every insertion.