CPSC 212-302 Name: Answer Key
Test #3, Part B April 20, 2005
Closed books. Closed Notes. Calculators OK. 85 points. 60 minutes. The weight of each question is
indicated in parentheses. Please use a pencil. If you need more space, use the back of the sheet.
1. (10) Consider the graph represented by adjacency matrix M1. Then answer the questions on the
right. The choices (T/F/N) stand for true, false, or not applicable.
2. (10) Consider the
graph represented by the
adjacency list shown in
L2. Apply Dijkstra’s
algorithm to the graph.
Put the final values
produced by the algorithm in the table on the right. Start with node C.
3. (5) Consider graph G3. Give a topological sort of the graph. Put your answer in the space on the
right.
___________________________________________
4. (5) Consider the following Huffman Code: a=110, e=01, t=10, s=111, space=00 and the
same characters in Morse Code: a=.-(dot dash), e=.(dot), t=-(dash), s=...(dot dot
dot). Calculate the number of bits required to represent each of the messages below using each of the
codes.
Number of bits using code
message Huffman Morse
“taste tests tease sate settee” ________ ________
(5) If a message has xa a’s, xe e’s, xt t’s, xs s’s, and xsp spaces, give a formula representing the number of
bits required by each of the codes.
Huffman:
dv pv
A ____ ____
B ____ ____
C ____ ____
D ____ ____
E ____ ____
F ____ ____
____ (a) (T/F/N) The graph is connected.
____ (b) (T/F/N) The graph is strongly connected.
____ (c) What is the outdegree of the node with the greatest outdegree?
____ (d) (T/F/N) Node A is adjacent to all other nodes?
____ (e) (T/F/N) The graph is a complete graph.
____ (f) (T/FN) The graph is directed.
____ (g) (T/F/N) The graph is weighted.
____ (h) (T/F/N) There exists a path of length 25 between nodes B and C.
____ (i) What is the cost of a minimum spanning tree of the graph?
____ (j) What is the cost of the shortest path between node C and node E?
P -> T -> Y Z -> P
Y -> T -> W Q -> L
X -> Y -> W L -> T
W -> L -> Q T = null
