CS301 Assignment no 3 Fall 2016Here we have CS301- Data Structures Assignment No. 3 Solution and discussion, Fall 2016, Total Marks: 15, Due Date: 20/01/2017.
You Can Also Download CS301 Solved Final Term Papers, CS301 Short Notes, CS301 Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz ,CS301 Solved Final Term Subjective Papers ,CS301 Solved Final Term Objective Papers from Virtual Study Solutions For Preparation of Final Term Papers.
CS301 Assignment InstructionsPlease 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 Ms Word 2003 file.
- 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 instructionsFor clarity and simplicity, You are required to Upload/Submit only Ms Word file (.doc or docx format).
Note: Use ONLY Microsoft Word
CS301 Assignment ObjectiveThe objective of this assignment is,
To make you familiar with concept of Huffman Encoding.
For any query about the assignment, contact at email@example.com
CS301 Assignment Statement:Question 1: [Marks 15]
While transmission through network, it is always important to keep data transmission rate high so data over the network can be increased using two ways; either increases the bandwidth of communication channel or decrease the size of data (compression) to increase the bandwidth utilization.
Lossless data compression algorithms are important in network and Huffman encoding scheme can be used for lossless data compression. Suppose the following string is being transmitted over the network:
“Data Compression in data structure”
We cannot increase the bandwidth of communication channel. Instead we have to compress the given string. Use Huffman encoding scheme to encode the given string.
To encode the string:
Build a table containing the following information about the string.
Build Huffman encoding tree. The tree will be built with the help of characters and their respective frequencies which you will find in step 1.
Calculate how much bits are consumed by original and compressed string. What percentage of bits is saved by Huffman encoding scheme?
Mention step by step construction of Huffman Encoding tree from the above table.
Also Read: HOW TO TAKE QUIZ ON LMS
CS301 Assignment no 3 Solution
- Please Wait.
- Assignment Solution of CS301 will be updated Soon.
If You want to receive the Solution directly in your inbox. Please Subscribe below or like us on Facebook.