CSE 326, Huffman Coding, Nov 14, 2004

CSE Home

CSE 326

Classroom Presenter

About Us

Search

Contact Info

Powerpoint slides

• Slide view
• Instructor view
• CSD Slides
• CSD Slides after lecture

Slide images

• Slide 0
• Slide 1
• Slide 2
• Slide 3
• Slide 4
• Slide 5
• Slide 6
• Slide 7
• Slide 8
• Slide 9
• Slide 10
• Slide 11
• Slide 12
• Slide 13
• Slide 14
• Slide 15
• Slide 16

Student submissions

• Slide 0 Write your name on a slide and submit it - this was just to get everyone started.
• Slide 2 Decode a pair of strings, the one on the left was straight forward, the one on the right was ambiguous, and did get a range of answers.
• Slide 5 Build a tree from a code.
• Slide 7 Compute the average leaf depth of a tree - it was decided not to do this one, and the example was worked quickly by the instructor.
• Slide 11Compute a huffman tree, given six data values

Selected Student Submissions

• Exercise 1
• Exercise 1
• Exercise 2
• Exercise 2
• Exercise 2
• Exercise 2
• Exercise 3
• Exercise 3
• Exercise 3
• Exercise 3
• Exercise 3

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to anderson@cs.washington.edu]