Using division method and mid-square method insert the additional keys in the order 6712, 3392, 7851...

 

Transcribed Image Text:

Using division method and mid-square method insert the additional keys in the order 6712, 3392, 7851 use Coalesced to resolve the collisions. (15pts) Use a table size of 9, insert the following into a hash table and using Cuckoo method to resolve collision: M(2,3); N(1,4); 0(1,6); P(1,0); Q(3,3); T(2,4) (10 pts) The following keys are inserted into an initially empty B-tree of order 3. Construct the B-Tree 4, 15, 5, 32, 3, 10, 28, 40, 32 and 56. (10pts) Insert the following keys in an AVL Tree 48,30,56,35,52,67,14,50,33 and 55. Using division method and mid-square method insert the additional keys in the order 6712, 3392, 7851 use Coalesced to resolve the collisions. (15pts) Use a table size of 9, insert the following into a hash table and using Cuckoo method to resolve collision: M(2,3); N(1,4); 0(1,6); P(1,0); Q(3,3); T(2,4) (10 pts) The following keys are inserted into an initially empty B-tree of order 3. Construct the B-Tree 4, 15, 5, 32, 3, 10, 28, 40, 32 and 56. (10pts) Insert the following keys in an AVL Tree 48,30,56,35,52,67,14,50,33 and 55.

Answer rating: 100% (QA)

Hashing with Coalesced Collision Resolution Using division method with a table size of 9 and midsqua... View the full answer