2. Answer the following questions: a. Consider each 3 consecutive digits in your ID as a key value. Using open hashing, insert items with those keys into an empty hash table and show your steps....


2. Answer the following questions:<br>a. Consider each 3 consecutive digits in your ID as a key value. Using open hashing, insert<br>items with those keys into an empty hash table and show your steps.<br>Example ID: 201920096<br>Key values: 201, 920, 096<br>tableSize: 2<br>hash(x) = x mod tableSize<br>b. Calculate the number of edges in a complete directed graph with N vertices. Where N<br>is equal to the 3rd and 4th digits in your ID. Show your steps.<br>Example ID: 201920096<br>N = 19<br>c. Calculate the number of nodes in a complete binary tree with height h. Where h is<br>equal to the 4th digit in your ID. Show your steps.<br>Example ID: 201920096<br>h = 9|<br>

Extracted text: 2. Answer the following questions: a. Consider each 3 consecutive digits in your ID as a key value. Using open hashing, insert items with those keys into an empty hash table and show your steps. Example ID: 201920096 Key values: 201, 920, 096 tableSize: 2 hash(x) = x mod tableSize b. Calculate the number of edges in a complete directed graph with N vertices. Where N is equal to the 3rd and 4th digits in your ID. Show your steps. Example ID: 201920096 N = 19 c. Calculate the number of nodes in a complete binary tree with height h. Where h is equal to the 4th digit in your ID. Show your steps. Example ID: 201920096 h = 9|

Jun 11, 2022
SOLUTION.PDF

Get Answer To This Question

Submit New Assignment

Copy and Paste Your Assignment Here