| || |
Assignment No. 04
SEMESTER fall 2011
CS301- Data Structures
Total Marks: 20
Due Date: 11th January
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted assignment does NOT open or file corrupt.
o The assignment is copied (from other student or ditto copy from handouts or internet).
The objective of this assignment is to give you some practice exercise of
o Huffman Encoding
o Comparison of Huffman code with ASCII code.
What to Submit
Submit the word file. Kindly note that C++ code is NOT required for this assignment.
For any query about the assignment, contact at firstname.lastname@example.org
| || |
Question No: 1 Marks: 20
Consider the following sequence:
computer revolutionized the world$
a) Draw frequency table 3 marks
b) Create a Huffman tree 8 marks
c) Determine the binary code for each character 5 marks
d) Compare the Huffman encoded sequence with the encoding of sequence with ASCII code 4 marks
Lectures Covered: This assignment covers Lecture # 24-26
Deadline: Your assignment must be uploaded/submitted at or before 11th January 2012.