University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page

CSC 477/677 Assignment 2
Due date: Thursday, September 24, 2009, 1:00 PM.
All assignments must be handwritten (not typed or printed from a computer
file) in your own handwriting, on 8.5 by 11 inch paper, or on A4 paper.
Write your name on each sheet, and do not fold the pages or crimp the corners.
(You may use a paper clip or a staple.)
Turn the pages in to me on or before the due date.
-
Work Problem 4-1 on page 85 of your textbook.
-
Work Exercise 9.3-8 on page 193 of your textbook.
-
Work Exercise 12.3-3 on page 264 of your textbook.
-
Work Exercise 15.4-1 on page 355 of your textbook.
-
Work either Exercise 15.4-5 or 15.4-6 on page 356 of your textbook.
-
Read Section 16.3 of your textbook, pages 385 to 391.
Then, using the frequencies of the uses of letters in English given by
Wikipedia,
constuct an optimal prefix code for the first thirteen letters of
the Roman alphabet, namely "a" through "m."
Use Huffman's algorithm.
-
Find the minimum spanning tree of
this weighted graph
using Kruskal's algorithm. Show the steps.
Same graph in pdf format.
-
(More?)

Back to
Course Page