MET CS 566 – SUMMER 2003
Homework 4:
Extra Credit
Total Points: 15
The following problems relate to material not covered in class: Choose one topic and
problem and summarize the related material so that the reader can understand why the
topic is of interest, and has the background needed to understand the solution to the
problem. Your summary of the topic should not be more than 3 pages. You do not
need to include all theorems and/or proofs. The goal is to
 formulate the problem;
 state why the problem is important – in theory and/or application;
 summarize only the part of the topic relevant to the problem solution.
Choose one of the following:
1. Open Addressing (11.4: p. 237): (Problem 11.4-1, p.244) Consider inserting the
keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table of length m=11 using open
addressing with the primary hash function h'(k) = k mod m. Illustrate the result of
inserting these keys using
 linear probing;
 quadratic hashing with c1=1 and c2=3;
 double hashing with h2(k) = 1 + (k mod(m-1))
or
2. Minimum Spanning Trees (23, p. 561): Following the examples in Figures 23.4,
23.5 trace the algorithms of Kruskal an Prim on the following spanning tree.
(You can work with this graph by copying it multiple times and
ungrouping/grouping as needed – the pictures are not part of your 3 page topic
summary)
a
3
b
8
e
4
2
12
12
f
15
h
c
25
d
4
17
5
g
20
3
i
7
1
10
j
k