Akhil Bharatiya Maratha Shikshan Parishad's

Anantrao Pawar College of Engineering & Research

Record No.: ADM/D/035A DoI: 02/01/2023

Revision: 00
Notice for Student

All the Second year computer engineering students are hereby inform to complete the following given
assignment of Data Structures and Algorithms on Unit No-1 Hashing. All are instructed to get it checked on
or before 07th February 2025.

Assignment No-1. Hashing.

Blooms
Sr. CO
No University Questions Details Mapped
Learning
Level
What is hashing? Explain the properties of good hash function with examples?
1 CO1 L1, L2
(FEB-23-4)
2 What is Hash function? Explain any 4 types of Hashing function with example CO1 L1, L2
Explain the concept of quadratic probing using example. What are the advantages
3 CO1 L1, L2
and disadvantages of quadratic probing over linear probing? (FEB-23-5)
What is collision with respect to hash function? What are different collision
4 CO1 L1, L2
resolution techniques? Explain in details with example.
5 Explain Rehashing with suitable example. CO1 L1, L2
Difference between 1) Open hashing and Closed hashing
6 CO1 L1, L2
2) Hashing and Skip list. 3)Quadratic probing and Double hashing.
7 Write a short note on Extendible hashing CO1 L1, L2
Explain about a skip list with an example. Give applications of skip list (FEB-23-
8 CO1 L1, L2
4)
For the given set of value 35, 36, 25, 47, 2501, 129, 65, 29, 16, 14, 99. Create a CO1,
9 L2, L3
hash table with size 15 and resolve collision using open addressing techniques CO2
Represent the following key in memory using Linear probing with and without
CO1, L2, L3
10 replacement. Use modulo 10 as your hashing function. CO2
24, 13, 16, 15, 19, 20, 22, 14, 17, 26
Insert the following data in the hash table of size 10 using linear probing with CO1, L2, L3
11
chaining without replacement : 131, 3, 4, 21, 61, 6, 71, 8, 9 CO2
For the hash table size of 10 using hash function key F(key) = key % 10 insert the
following keys CO1,
L2, L3
12 CO2,
i) 65, 75, 25, 29, 85, 39, 36. Use linear probing with chaining without replacement CO4.
ii) 25, 3, 21, 13, 1, 2, 7, 12, 4, 8 Use linear probing with replacement
Assume the size of hash table as 8. The hash function to be used to calculate the
CO1, L2, L3
13 hash value of the data X is: X%8. Insert the following values in hash table: 10, 12, CO4.
20, 18, 15. Use linear probing without replacement for handling collision
Insert the following data in the hash table of size 10, using linear probing with CO1, L2, L3
14
chaining with replacement. Here h(x) = x%10 and Keys - 21, 35, 31, 37, 32, 33, 48 CO4.
We have a hash table of size 10 to store integer keys, with hash function h(x) = x
mod 10. Construct a hash table step by step using linear probing without CO1,
L2, L3
15 replacement strategy and insert elements in the order 31,3,4,21,61,6,71,8,9,25. CO2,
Calculate average number of comparisons required to search given data from hash CO4.
table using linear probing without replacement (FEB-23-6)
Insert the following data in the hash table of size 10 using linear probing with CO1,
L2, L3
16 chaining by applying with replacement: 11, 33, 20, 88, 79, 98, 68, 44, 66, 24. CO2,
Calculate average number of comparisons required to search given data from hash CO4.
 Akhil Bharatiya Maratha Shikshan Parishad's

Anantrao Pawar College of Engineering & Research

Record No.: ADM/D/035A DoI: 02/01/2023

Revision: 00
Notice for Student

table. (FEB-23-6)
Add following keys in hash table by applying extendible hashing mechanism.
CO1, L2, L3
17 Assume capacity of each directory to store buckets is 3. CO4.
Keys are 10, 20, 15, 12, 25, 30, 7, 11, 08 (FEB-23-5)
Create a Hash table and resolve collisions using linear probing with and without
CO1, L2, L3
18 replacement : 9, 45, 13, 59, 12, 75, 88, 11, 105, 46 CO4.
Hash table size = 7 and Hash function = key mod 7
Create a Hash table and resolve collisions using Quadratic Probing :{4371, 1323,
CO1, L2, L3
19 6173, 4199, 4344, 9679, 1989} Hash table size =10 and Hash function = key mod CO4.
10.
Given the Inputs :{ 4371, 1323, 6173, 4199, 4344, 9679, 1989} Hash table size
=10 and Hash function = key mod 10. show the results for the following: CO1,
L2, L3
20 i)Open addressing hash table using Linear Probing CO2,
ii)Open addressing hash table using Quadratic Probing CO4.
iii)open addressing hash table with second hash function h2(X)=7-(x mod 7)
Explain Quadratic Probing and solve with data 1111, 1253, 5133, CO1, L2, L3
21
4899, 2364, 8979, 2899, table size is 10 CO4.
Explain Double hashing and solve with data 4371, 1323, 6173, 4199, 4344, L2, L3
22
9679, 1989. Table size is 10, with 2nd hash function given is 7- key mod 7

Prof. Anil T. Lohar, HoD,

Subject In-Charge Computer Engineering Department