- Write an algorithm to implement Bubble sort with suitable example.
- Explain any two techniques to overcome hash collision.
- Write an algorithm to implement insertion sort with suitable example.
- Write an algorithm to implement selection sort with suitable example.
- Write an algorithm to implement radix sort with suitable example.
- Write an algorithm for binary search with suitable example.
- Discuss the common collision resolution strategies used in closed hashing system.
- Given the input { 4371, 1323, 6173, 4199, 4344, 9679, 1989 } and a hash function of h(X)=X (mod 10) show the resulting:
a. Separate Chaining hash table
b. Open addressing hash table using linear probing - Explain Re-hashing and Extendible hashing.
- Show the result of inserting the keys 2,3,5,7,11,13,15,6,4 into an initially empty extendible hashing data structure with M=3. (8) (Nov 10)
- what are the advantages and disadvantages of various collision resolution strategies? (6)
Discover more from Soa Technology | Aditya Website Development Designing Company
Subscribe to get the latest posts sent to your email.
