Scribd
Upload
2 views

Algorithm and Data Structure Assignment3-10-23

Uploaded by

Mrunal Parulkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Algorithm and Data Structure Assignment3-10-23

Uploaded by

Mrunal Parulkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Algorithm and Data Structure Assignment-3/10/23

Answer Writing Analysis 3/10/23-8:30pm , 4/10/23-7:00am.

Be ready with your pdf.

Note:-Join the session on time.

Q1)What is Hashinh.Explain the different type of hash function.

Q2)Explain different collision resolution technique with example.

Q3)What is the application of hasing.

Q4) Demonstrate what happens when we insert the keys 5; 28; 19; 15; 20; 33; 12; 17; 10

into a hash table with collisions resolved by chaining. Let the table have 9 slots,

and let the hash function be h(k)k mod 9.

Q5) Consider inserting the keys 10; 22; 31; 4; 15; 28; 17; 88; 59 into a hash table of
length m = 11 using open addressing with the auxiliary hash function h’(k)=k.
Illustrate the result of inserting these keys using
linear probing,
using quadratic probing with c1 = 1 and c2 = 3, and using double hashing with h1(k)=k and
h2(k)= 1 + (k mod (m -1)).

You might also like