DATA COMPRESSION, exam, UPTU 2007, Exams of Data Compression

Uttar Pradesh Technical University (UPTU) Examination on loseless compression, redundency of code, Hyffman procedure, Golomb code, Huffman code, run length code, Binary code, Markov compression, Average mutual information

Typology: Exams

2010/2011

Uploaded on 08/27/2011

nihira
nihira 🇮🇳

4.3

(63)

90 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pf3
pf4

Partial preview of the text

Download DATA COMPRESSION, exam, UPTU 2007 and more Exams Data Compression in PDF only on Docsity!

Printed Pages : 4 CS — 054 (Following Paper ID and Roll No. to be filled in your Answer Book) EERO Fone EEE B. Tech. (SEM. VIII) EXAMINATION, 2006-07 DATA COMPRESSION Time : 3 Hours] {Total Marks : 100 Note : Attempt all questions. All questions carry equal marks. 1 Attempt any four parts of the following : 5x4=20 (a) What do you mean by lossless compression? Compare lossless compression with lossy compression. (b) Explain Modeling and coding with the help of suitable examples. (c) Suppose X is a random variable that takes on values from M.letter alphabet show that 0 < H( < log, M (d) What do you understand by information and entropy ? Find the first order entropy over an alphabet A = {a),@2,83,a4} where P (ay) = p(a,) = p (ay) = p (ay) = 1/4 (e) What do you understand by Prefix code ? (f) The joint probabilities of the transmitted and received messenges of a communication system is given as V-1051] 1 (Contd...