Tags:
tag this topic
create new tag
view all tags
---+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 1. Learn about Huffman coding 1. 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 1. Test and debug your code ---++ Submission instructions for Phase 2 1. Complete the SDR. 1. Combine your SDR and all of your .java and testing files into one zip folder 1. 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.
E
dit
|
A
ttach
|
Watch
|
P
rint version
|
H
istory
: r2
<
r1
|
B
acklinks
|
V
iew topic
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r2 - 2022-08-23
-
cathybareiss
Home
Site map
Assessment web
BethelAIResources2026 web
CenterForComputing web
ChatGPT web
Intro2AIatBethel web
Main web
Sandbox web
TWiki web
CenterForComputing Web
Create New Topic
Index
Search
Changes
Notifications
RSS Feed
Statistics
Preferences
P
P
View
Raw View
Print version
Find backlinks
History
More topic actions
Edit
Raw edit
Attach file or image
Edit topic preference settings
Set new parent
More topic actions
Account
Log In
Register User
E
dit
A
ttach
Copyright © 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