Scribd
Upload
17 views1 page

Data Compression (Term 2 Set A)

This document outlines the Term-I Examinations for the Data Compression course at Sanskriti University, detailing the structure of the exam including parts A, B, and C with specific questions and marks allocation. It includes very short answer questions, short answer questions, and longer questions requiring design or explanation. The exam covers topics such as Huffman coding, adaptive Huffman coding, and Golomb codes.

Uploaded by

Sushil Kumar Tripathi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views1 page

Data Compression (Term 2 Set A)

This document outlines the Term-I Examinations for the Data Compression course at Sanskriti University, detailing the structure of the exam including parts A, B, and C with specific questions and marks allocation. It includes very short answer questions, short answer questions, and longer questions requiring design or explanation. The exam covers topics such as Huffman coding, adaptive Huffman coding, and Golomb codes.

Uploaded by

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

Enrol.

No:
SANSKRITI UNIVERSITY
Mathura, Uttar Pradesh Set A

Term – I Examinations Feb-2025


Course Code: DCS 330 Course Name: Data Compression
Name of School: University of Polytechnic
Programme: Diploma CS Semester: VI
Time: 60 Minutes Max. Marks:20
PART – A (6 questions X 1 marks = 6 Marks)
Answer ALL the Questions

1. Very Short Answers/Multiple Choice Questions


a. What is the meaning of Huffman Code Data Compression? [1]
b. What are the three steps in Adaptive Huffman Coding? [1]
c. What is the default value of the NYT? [1]
d. What will be the weight of “a” symbol in the tree if “a” is occurring second time in [1]
message of Adaptive Huffman Coding: Update tree?
e. Which symbols are denoted for Internal nodes and External nodes respectively? [1]
f. Calculate the unary code of the value 9? [1]
PART – B (3 questions X 2 marks = 6 Marks)
(Short Answer Type Questions)
2. Explain the steps of Adaptive Huffman coding for encoding. [2]
3. What do you understand by Coding a sequence. [2]
4. Calculate Code and Code length in Huffman Code Data Compression: [2]
Symbol Frequency
A 24
B 12
C 10
D 08
E 08
PART – C (2 questions X 4 marks = 8 Marks)
Answer any Two out of Three Questions
5. Design Golomb Code for 9 with divisor 4. [4]
6. Explain about Coding a sequence, Generating a binary Code. [4]
7. Design a Update tree: [4]
Message: [a a r d v a r k]

Page 1 of 1

You might also like