CSC 477/677 Assignment 6
Fall 2004
Due April 29, 2004
-
Use Graham's Scan to find the convex hull of
this set of points.
(You are to walk through the algorithm by hand, rather than writing a
computer program.)
-
Use Huffman's algorithm to find an optimal prefix coding
for the alphabet consisting of all the symbols in the following message:
See the sleek geek meekly shriek.
Don't forget that spaces and the period are symbols. Make it case-sensitive.
To determine frequencies, count how many times each symbol occurs in the message.
For example, the symbol 'h' has frequncy 2.
After finding an optimal prefix coding, translate the message into a string
of bits using that code.
Back to
Course Page
