Question

Texas 20 California 43 Nevada 2 Pennsylvania 14 Indiana 9 Texas, California California, Nevada California, Pennsylvania Pennsylvania, Indiana (a) Draw the graph represented by the information in this file. (b) Suppose that sequence numbers are assigned (as they would be in the order in which the vertices are listed. Suppose that the hash table for names consists of 13 locations (addresses 0 through 12), and suppose the hash function is the rather crude one of counting the letters in the string, multipl length by 7, dividing the product by 13, and using the remainder as the hash table address. (Example: Texas hashes to address 9). Build the hash table that records the sequence number assignments. Also draw the adjacency structure that would result from constructing the edge lists by adding each new edge node to the front of the list. Each cell in the vertex array should contain the weight of the vertex as well as a pointer to the edge list. Think about how a program would build this adjacency structure while it was reading the input file.

Answer 1

Address	Node value
0	Nevada
1
2
3
4
5	California
6	Pennsylvania
7	Indiana
8
9	Texas
10
11
12