DATA COMPRESSION AND ENCRYPTION (DCE) MAY 2010 [ELECTIVE] ELECTRONICS AND TELECOMMUNICATION SEMESTER 7
Con.3452-10. AN-2875.(4 Hours) [Total Marks:-100]
N.B. (1) Question No.1 is compulsory.
(2) Attempt any four questions out of remaining six questions.
1. (a) Compare lossy and lossless compression techniques with suitable examples. [5 Marks]
(b) What are uniquely decodable codes? What are the tests performed to determine
them. [5 Marks]
(c) Compare the Arithmetic and Huffman coding. [5 Marks]
(d) What are the main features of digital signature? [5 Marks]
2. Consider a discrete memoryless source with probability {0.35, 0.25, 0.20, 0.15, 0.05}
Determine :- [20 Marks]
(i) Huffman code for this source.
(ii) Huffman code by minimum variance method.
(iii) Determine average length, entrophy and efficiency.
(iv) Draw binary root tree for both the codes.
3. (a) With S = {m, n, o, p} and p= {0.4, 0.3, 0.1, 0.2} encode message m n o p using
arithmetic code. Generate tag for encoding and also decipher the tag to decode the sequence
back. [10 Marks]
(b) Why is DCT more popular for image compression? Discuss its usage in JPEG. [10 Marks]
4. (a) Describe various standards of MPEG audio and video compressions. [10 Marks]
(b) Explain the role played by KDC in symmetric encryption. [10 Marks]
5. (a) Explain the working of DES with block diagram. [10 Marks]
(b) Explain Hash and MAC codes used for authentication. [10 Marks]
6. (a) Explain RSA algorithm with appropriate example. [10 Marks]
(b) Explain various key management techniques. [10 Marks]
7. Write short notes on any two:- [20 Marks]
(a) Chinese remainder theorem
(b) Run Length Coding.
(c) A law and law of companding.
(d) Text compression using PPM method.