I need it in 10 min ID NUMBER : 202010534
Posted: Fri May 20, 2022 10:40 am
I need it in 10 min
ID NUMBER : 202010534
Question 4 (6 + 6 + 12 = 24 marks) 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: 201710349. You must use your own ID. Key values: 201, 710, 340 tableSize: 2 hash(x) = x mod table size b. Calculate the number of edges in a complete undirected 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 matrix representation of a directed graph where there are no weights assigned to the edges. Draw 1. The graph and 2. The adjacency list with this adjacency matrix representation 2 (6 3
- I Need It In 10 Min Id Number 202010534 1 (75.5 KiB) Viewed 28 times
Question 4 (6 + 6 + 12 = 24 marks) 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: 201710349. You must use your own ID. Key values: 201, 710, 340 tableSize: 2 hash(x) = x mod table size b. Calculate the number of edges in a complete undirected 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 matrix representation of a directed graph where there are no weights assigned to the edges. Draw 1. The graph and 2. The adjacency list with this adjacency matrix representation 2 (6 3