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 tableSize 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
if you have this question, you need to draw adjacency matrix + adjacency list 6. Below an adjacency matrix representation of a directed graph where there are no weights assigned to the edges. Draw 1. The graphs and 2. The adjacency list with this stacerty matrix representation graph Matrix 2 5 6 3
Question 4 (6 + 6 + 12 = 24 marks) a. Consider each 3 consecutive digits in your ID as a key value. Using Open Hashing,
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am