Question 4 6 6 12 24 Marks A Consider Each 3 Consecutive Digits In Your Id As A Key Value Using Open Hashing In 1 (80.66 KiB) Viewed 52 times
Question 4 6 6 12 24 Marks A Consider Each 3 Consecutive Digits In Your Id As A Key Value Using Open Hashing In 2 (80.66 KiB) Viewed 52 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. ID: 20201520. You must use your own ID. Key values: 202, 015, 520 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. ID: 202010520. N = 20 c. Below an adjacency matrix representation of a directed graph where there are no weights assigned to the edges. Draw 1. The matrix and 2. The adjacency list with this graph representation 2 N 5 5 6 3
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!