Midterm Study Guide
CSE 490 G: Introduction to Data Compression
Winter 2006

Midterm Exam, February 10, 2006

• Midterm Policies
  • You may bring your own notes.
  • You may bring the class handouts and assignment solutions.
  • You may bring the Sayood book.
  • You may bring a caclulator, but it should be needed only seldom if at all.
  • The exam begins promptly at 1:30 and ends at 2:20.
• Topics Covered
  • Basic information theory, first-order entropy
  • Huffman coding, adaptive Huffman coding
  • Golomb coding
  • Tunstall coding
  • Arithmetic coding. Scaling, context, adaptivity.
  • LZW
  • LZ77
  • Sequitur
  • Predictive coding, move to front coding
  • Burrows-Wheeler transform
• Study suggestions
  • Work in study groups to help each other out in preparation. Give each other problems to do in an exam setting. After doing the problems alone, critique each others answers.
  • You will want to work out small examples of both encoding and decoding for all the algorithms we have covered.
  • The following problems from the book are worth trying for practice. Pages 77-80, problems 4, 11, 12, 13. Pages 114-115, problems 5, 6, 7, 8. Pages 139-140, problems 3, 4, 5, 6, 7.
  • Review all the solutions for the weekly assignments to make sure you understand them.
  • Do the midterm from 2 years ago.

  ---

  ladner@cs.washington (Last Update: )