
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Information about homework 9 for the cmpsc 465, spring 2009 course. It includes instructions for submitting the homework, problem statements for three problems related to prim's algorithm, kruskal's algorithm, and dijkstra's algorithm, as well as references to exercises from the textbook. Students are expected to use printouts from the document to illustrate the algorithms and solve the problems.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Due: Saturday, April 18, 1 pm. slide under the door of IST 346H, between 7 pm Friday and 1 pm Saturday they will be box in front of IST 337.
Problem 1.
a) Explain how Pictures for Prim’s Algorithm illustrate the algorithm. What are the edge costs? What is the meaning of the colors of edges? What is the meaning of red and blue numbers?
b) Use printouts of the third page of that file to illustrate how Kruskal’s algorithm runs.
b) Use printouts of the third page of that file to illustrate how Disjksta’s algorithm runs.
Problem 2. Your task is to compress a text in which each symbol is random, 0 or 1, but 1’s occur with probability that is twice larger. Make an ‘‘alphabet’’ of strings of length 3 and provide Huffman code. How much shorter will the code be compared with the text, on the average?
Exercise 6, page 333.
Exercise 2, page 362.