Assignment No.

03
Total Marks: 20
Spring 2019
CS301 - Data Structures Due Date: 19th July, 2019

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 Microsoft Word file (.doc or .docx)
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
You are required to upload / submit Microsoft Word file.

Objective
The objective of this assignment is ;

o To make you familiar with Huffman Encoding technique.

o To learn how to develop Frequency table and construct Huffman Tree.

For any query about the assignment, contact at CS301@vu.edu.pk

GOOD LUCK

Problem Statement

As you know, Huffman Encoding is a technique developed and used for data compression. It is widely used
algorithm for JPEG images. You are required to apply Huffman Encoding on the given string.

leaders in education technology

To encode this string, you should;

1. Develop a frequency table containing characters along with their respective frequencies as per
following format.

Character Frequency

Note: Make sure that you should fill above table according to the occurrence of characters in the
given string.
 2. Construct Huffman Encoding Tree according to the characters and their respective frequencies table
that you build in earlier step. Show final Huffman Tree only and don’t show intermediate steps.

Note: Make sure that edges of nodes should not cross each other while developing Huffman Tree.

Deadline: Your assignment must be uploaded/submitted at or before 19th July 2019.