Page 1 of 1

CS 301 Assignment 04 spring 2012

PostPosted: Wed Jun 13, 2012 10:19 pm
by saad7675
Assignment No. 04
SEMESTER Spring 2012
CS301- Data Structures
Total Marks: 20

Due Date: June 18, 2012
Instructions
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 is other than MS Word 2003 file.
o The submitted assignment does NOT open or file is corrupted.
o The assignment is copied (from other student or ditto copy from handouts or internet).
Uploading instructions
For clarity and simplicity, You are required to Upload/Submit only MS Word 2003 (*.doc) file.
Objective
The objective of this assignment is

o To make you familiar with Huffman Encoding Algorithm.

For any query about the assignment, contact at cs301@vu.edu.pk
GOOD LUCK

Assignment Statement: Marks: 20

Suppose you are given a string “You will receive this message in two days”, Use Huffman Encoding algorithm to create a binary tree with this string.


Solution Guidelines:

In step 1, You have to create a frequency table of characters along with their frequencies.

In step 2: You have to create Binary Tree from letters and their frequencies created in step 1.


Lectures Covered: This assignment covers Lecture # 25-26
Deadline: Your assignment must be uploaded/submitted at or before June 18, 2012