c) Consider a hash table of size 11 with hash function h(x) = x mod 11. For each of thethree scenarios specified below, draw the table that is the result after inserting, in thegiven order, the following values: 55, 35, 54, 30, 77, 59, 65, 96, 125:(i) When collisions are handled by separate chaining;=(ii) When collisions are handled by double hashing using a second hash function h'(x) =(x mod 5) + 1. Hint, the overall (combined) hash function is H(x) = (h(x) + i xh'(x)) mod 11, where i = 0, 1, 2, 3, ...(iii) When collisions are handled by quadratic probing with a quadratic probe functionh'(x, i) = (h(x) + 0.5 i +0.5 i²) mod 11 where i = 1, 2, 3, .... a) A list of student's names is maintained in an AVL tree T. Design an algorithm forperforming the operation findAll to return all the names in the AVL tree that match thesearched name. Note that there is a possibility that same names exist in the tree. Inthe case that the same name exists, the name is added to the left subtree.b) Delete element 60 in the following Binary Search Tree (BST). Provide a briefdescription/explanation how the delete operation is performed. Your explanation canbe in point form. Show the final Binary Search Tree (after the deletion of element 60).1020ส253230404945501805551602307074807576

Answered: c) Consider a hash table of size 11…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

c) Consider a hash table of size 11 with hash function h(x) = x mod 11. For each of the
three scenarios specified below, draw the table that is the result after inserting, in the
given order, the following values: 55, 35, 54, 30, 77, 59, 65, 96, 125:
(i) When collisions are handled by separate chaining;
=
(ii) When collisions are handled by double hashing using a second hash function h'(x) =
(x mod 5) + 1. Hint, the overall (combined) hash function is H(x) = (h(x) + i x
h'(x)) mod 11, where i = 0, 1, 2, 3, ...
(iii) When collisions are handled by quadratic probing with a quadratic probe function
h'(x, i) = (h(x) + 0.5 i +0.5 i²) mod 11 where i = 1, 2, 3, ....

a) A list of student's names is maintained in an AVL tree T. Design an algorithm for
performing the operation findAll to return all the names in the AVL tree that match the
searched name. Note that there is a possibility that same names exist in the tree. In
the case that the same name exists, the name is added to the left subtree.
b) Delete element 60 in the following Binary Search Tree (BST). Provide a brief
description/explanation how the delete operation is performed. Your explanation can
be in point form. Show the final Binary Search Tree (after the deletion of element 60).
10
20
ส
25
32
30
40
49
45
50
180
55
51
60
230
70
74
80
75
76

Expert Solution

Step 1

Algorithm:

1 - input the rootNode.

2 - input the name(the name which is being searched).

3 - if rootNode = null then print "There is no node in the tree."

End if

4 - if rootNode.data = nodeValue the print "The name has been found successfully."

End if

5 - if rootNode.data >= name then

if rootNode.leftChild.data = name then print "The name has been found successfully" otherwise call function recursively findAll(rootNode.leftChild, name)

End if

6 - if rootNode.data < name then

if rootNode.rightChild.data = name then print "The name has been found successfully" otherwise call the function recursively findAll(rootNode.rightChild, name)

End if