a. Consider each 3 consecutive digits in your ID as a key value. Using linear propping,...

Transcribed Image Text:

a. Consider each 3 consecutive digits in your ID as a key value. Using linear propping, inser t items with those keys into an empty hash table and show your steps. Example ID: 201710349. You must use your own ID. Key values: 201, 710, 340 tableSize: 3 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: 201710340. You must use your own ID. N=17 c. Below an adjacency list representation of an undirected graph where there are no weights assigned to the edges. Draw 1. the graph and 2. the adjacency matrix with this adjacency list representation. 2 3 4 5 2 6 1 1 4 3 4 $8.47 $8-03-07 4 7 5 5/ a. Consider each 3 consecutive digits in your ID as a key value. Using linear propping, inser t items with those keys into an empty hash table and show your steps. Example ID: 201710349. You must use your own ID. Key values: 201, 710, 340 tableSize: 3 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: 201710340. You must use your own ID. N=17 c. Below an adjacency list representation of an undirected graph where there are no weights assigned to the edges. Draw 1. the graph and 2. the adjacency matrix with this adjacency list representation. 2 3 4 5 2 6 1 1 4 3 4 $8.47 $8-03-07 4 7 5 5/

Answer rating: 100% (QA)

Answer a In hash table we insert the key at the position calculated by hash function If there is any ... View the full answer