CS301 Assignment no 3 Solution Spring 2019

CS301 Assignment no 3 Spring 2019

Dear Students, Here you can read or Download CS301 - Data Structures Assignment No 3 Solution of Semester Spring 2018. Assignment Due Date is 19 July, 2019. Total Marks are 20. This assignment covers lesson no. 23 to 33. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. CS301 Assignment Solution File has been added. Previously we shared CS201 Assignment No 3 Solution Spring 2019.

CS301 Assignment no 3 Solution and Discussion Spring 2019

CS301 Assignment 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:

The assignment is submitted after due date.

The submitted assignment is other than Microsoft Word file (.doc or .docx)

The submitted assignment does NOT open or file is corrupted.

The assignment is copied (from other student or ditto copy from handouts or internet).

CS301 Assignment Uploading instructions

You are required to upload / submit Microsoft Word file.

CS301 Assignment Objective

The objective of this assignment is ;

To make you familiar with Huffman Encoding technique.

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

CS301 Assignment Question

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;

Question No 1

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

Character	Frequency
NL
SP
a
c
d
e
g
h
i
l
n
o
r
s
t
u
y

Note: Make sure that you should fill above table according to the occurrence of characters in the given string.

Question No 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.

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