hw10 - Hint: review pages 410-411 for an example of how to...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE331 Section 2 Homework 10 Due: Friday April 11, 2008 at 11:59am 1. For the problem of making change, consider the greedy rule: choose the largest denomination. Does the greedy rule always give an optimal solution for the cur- rency system {5, 4, 1}? If yes, prove your claim. If not, give a small counter- example to prove your claim. 2. Problem 10.1 on page 475.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Hint: review pages 410-411 for an example of how to format your answer. 3. Problem 10.3 on page 475. Draw the resulting Huffman coding tree. When com-bining 2 trees into 1, use the subtree with lower weight as the left node. 4. Problem 10.5 on page 477. The proof begins on page 418. Complete the proof by induction. 5. Problem 10.10 on page 477....
View Full Document

This note was uploaded on 07/25/2008 for the course CSE 331 taught by Professor M.mccullen during the Spring '08 term at Michigan State University.

Ask a homework question - tutors are online