Difference: CSC122F2022Lab6HuffmanTree (1 vs. 2)

Revision 22022-08-23 - cathybareiss

Line: 1 to 1
Changed:
<
<
META TOPICPARENT name="CSC122SylS2022"
>
>
META TOPICPARENT name="CSC122SylF2022"
 

Binary Trees and Huffman Coding

Huffman coding is a way to do lossless compression. Details can be found at: https://en.wikipedia.org/wiki/Huffman_coding For this lab you will be given a file that has been encoded. You need to decode it.

Objectives

Revision 12022-08-17 - cathybareiss

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="CSC122SylS2022"

Binary Trees and Huffman Coding

Huffman coding is a way to do lossless compression. Details can be found at: https://en.wikipedia.org/wiki/Huffman_coding For this lab you will be given a file that has been encoded. You need to decode it.

Objectives

  1. Learn to work with binary trees
  2. Learn about Huffman coding
  3. Improve your recursion skills

Assignment

Phase 1:
  1. Turn in the software design report as a pdf by the due date specified on Canvas.
Phase 2:
  1. Implement your designs
  2. Test and debug your code

Submission instructions for Phase 2

  1. Complete the SDR.
  2. Combine your SDR and all of your .java and testing files into one zip folder
  3. Submit the zip folder on Canvas by the due data specific there.

Restrictions:

  • You may not use any Internet resources (other than to look up Java syntax).
  • You may use code from this course or last semesters.
View topic | History: r2 < r1 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2026 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback