CS301 Assignment No. 2 Spring Fall 2022

0

       

Vu All Subjects Assignment Quiz GDB Handouts Available here



Aslam U Alaikum!

Dear Students

In this post we are providing you CS301 Assignment No. 2 Spring Fall 2022 100% correct or right solution. You'll Download assignment Solution File From below download (Click Here For Download File) link interface.

You should never copy paste the same answer which we are providing. Please do make some changes in the solution file.

Instructions:

Problem Statement:                                                                                                                          Marks 20

            A competition of best quotes is being held in an educational institute. Administration of the institute will collect the quotes (messages) from students over the internet as a text file. A task assigned to you is to use the Huffman encoding technique and build a binary tree that will be used to encode and decode the content of text files. Consider the message given below that is saved in text files and received through the internet. You have to build a frequency table and Huffman encoding binary tree. Furthermore, calculate the efficiency of this encoding technique and calculate how much bandwidth is saved for compressing the files/messages of 10,000 students.

 

Text Message:

            Education is one thing no one can take away from you

 

Solution Instructions:

 

You need to perform following step by step tasks to compress the message, calculate the efficiency and find bandwidth saved for the messages of 10,000 students:

1.      Count all the letters including space from the given text message.

2.      Draw a table with column names (letter, frequency, original bits, encoded bits)

3.      Fill the table with letters, frequency, original bits (for original bits get ASCII decimal code of each letter, convert the decimal ASCII into 8 bits binary code) and encoded bits (these can be found from Huffman encoding tree as mentioned in point 5).

4.      Draw final Huffman encoding tree with the help of frequency table. (Step by step construction of Huffman encoding tree is not required, just show the final tree in the solution file).

5.      Get the encoded bits from tree and fill code of each letter in last column of table constructed in step 2.

6.      Calculate the efficiency of Huffman encoding technique.

(For efficiency use total original bits, total compressed (encoded) bits and find what percentage of memory is saved with the help of Huffman encoding technique).

7.      For the calculation of bandwidth saved for 10,000 messages, use the calculation performed in step 6.

Note:

Consider all the characters/letters are in lower case and new line characters are not used in the message.

Code is not required.

Solution: 

File in Word 

You'll Download File in Word CS301 Assignment No. 2 Spring Fall 2022  From below download (Download) link interface.

         

File in PDF

You'll Download File in PDF CS301 Assignment No. 2 Spring Fall 2022  From below download (Download) link interface.

 

If you appreciate our work, please share our website vuonlinehelp.blogspot.com with your friends.

We are here to provide Latest Virtual University Assignment Solutions, GDB Solutions, Quiz  Solution, Midterm Past Papers, and Final term Past Papers in this website.



Post a Comment

0Comments

Thanks everone

Post a Comment (0)