UPTU Computer Engineering (Semester 7)
Distributed Systems
December 2011
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Describe different parameters used to evaluate the performance of compression algorithms.
7 M
1(b) What is the need of data compression? Differentiate between lossy compression and lossless compression.
7 M

2(a) Explain Adaptive Huffman compression technique in detail and compare it with Huffman technique.
7 M
Solve any one question from Q.2(b) & Q.2(c)
2(b) Describe the procedure for building the Huffman tree with example.
7 M
2(c) Explain Shannon-Fano Algorithm with example.
7 M

Solve any one question from Q.3 & Q.4
3(a) Describe Arithmetic Coding with example and compare it with Huffman coding.
7 M
3(b) Discuss BITIO.C
7 M

4(a) Discuss MAIN-C.C & MAIN-E.C
7 M
4(b) Define Data Compression. Explain modelling, coding and entropy with example.
7 M

Solve any one question from Q.5 & Q.6
5(a) Differentiate static and adaptive dictionary based compression technique with example.
7 M
5(b) Describe LZSS compression in detail.
7 M

6(a) Explain LZ77 algorithm. Also discuss problems with LZ77.
7 M
6(b) Explain Differential Modulation and Adaptive coding.
7 M

Solve any one question from Q.7 & Q.8
7(a) (i) Discuss Inverse DCT.
(ii) List applications of Data Compression.
7 M
7(b) Explain Discrete Cosine Transform.
7 M

8(a) Describe JPEG.
7 M
8(b) Explain Speech Compression with appropriate diagrams.
7 M



More question papers from Distributed Systems
SPONSORED ADVERTISEMENTS