Scribd
Upload
335 views

CCS353 Set2

This document outlines the practical end-semester examination for the Fifth Semester CCS353 Multimedia Data Compression and Storage course. It includes 10 questions related to data compression techniques like Huffman coding, run-length encoding, Lempel-Ziv coding, and arithmetic coding. Students must answer any one question set that involves developing code, providing explanations and analyses, or outlining plans to demonstrate their understanding of multimedia data compression concepts and applications.

Uploaded by

Bebi Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
335 views

CCS353 Set2

This document outlines the practical end-semester examination for the Fifth Semester CCS353 Multimedia Data Compression and Storage course. It includes 10 questions related to data compression techniques like Huffman coding, run-length encoding, Lempel-Ziv coding, and arithmetic coding. Students must answer any one question set that involves developing code, providing explanations and analyses, or outlining plans to demonstrate their understanding of multimedia data compression concepts and applications.

Uploaded by

Bebi Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B.E/B.Tech.

PRACTICAL END-SEMESTER EXAMINATIONS NOVEMBER/DECEMBER 2023

Fifth Semester

CCS353 MULTIMEDIA DATA COMPRESSION AND STORAGE

(Regulations 2021)

Time: 3 Hours Answer any one Question (set 2) Max.


Marks: 100

Aim Program Output Record Viva-voce Total


(10) (30) (30) (10) (10) (100)

1.a) Given the following set of symbol probabilities (in percentage):

 X: 40%
 Y: 25%
 Z: 20%
 W: 10%
 V: 5%

1. Calculate the entropy of this probability distribution.

2. Construct the Huffman code for these symbols and calculate the average code length.

b) In a hypothetical data compression scenario, if you encounter the binary sequence


“101010110011110”; decode it using the Huffman codes constructed in question a2.

2.a) Develop a Python program to perform run-length encoding on a text string. Include error
handling and provide sample input and output to demonstrate its functionality.

b) Compare run-length encoding with other compression methods, such as Huffman coding
and Lempel-Ziv-Welch (LZW). Discuss the advantages and disadvantages of each
technique in different use cases.

3. Explain the basic concept of the Lempel-Ziv (LZ) algorithm. How does it work to achieve
data compression, and what makes it particularly effective for certain types of data?

01
4. Develop a Python program for arithmetic coding. Provide sample code and demonstrate
the compression of a user-defined input word using the provided letter frequencies.

5. Write a shell script that performs the task of converting all image files within the current
directory to JPEG format. Ensure that the script processes image files only and maintains
the original image files.

6. Implement the program according to the plan outlined in question 2. You may use
popular libraries like OpenCV to assist you. Provide the code and detailed explanations
for each step of the process.

7. Develop a comprehensive plan for creating a photo album of a recent trip. Include
considerations for selecting and preparing images, optimizing image dimensions, and
choosing suitable image formats.

8. Implement the program according to the plan outlined in question 2. Include details on
how you would process server logs and calculate content popularity. Provide sample
code snippets and explanations.

9. Implement the program according to the plan outlined in question 2. Provide sample code
snippets and explanations of how the program distributes and retrieves data across strips
while ensuring redundancy.

10. Implement the program according to the plan outlined in question 2. Provide code
examples and explanations of how your program efficiently schedules and processes
data stream requests.

02

You might also like