Scribd
Upload
13 views

Assignment 3

Uploaded by

B67.Saniya Sanadi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Assignment 3

Uploaded by

B67.Saniya Sanadi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Module 3

1. Explain each stage of JPEG encoding with diagrams. (10 Marks)


2. Describe the multimedia operating system's function with respect to real-time processing
and QoS-based resource management. (10 Marks)
3. Define distributed multimedia systems with block diagrams and salient features. (10
Marks)
4. Explain Huffman coding for given data. (06 Marks)
5. Explain the concept of run-length coding and statistical encoding(10 Marks)
6. Explain GIF and TIFF format. (10 Marks)
7. Explain IP rnulticast and RSVP protocol. . (10 Marks)
8. A message and its probability of occurance of each character is as follows :A and B =
0.25, C and D = 0.14, E, F, G and H = 0.555 Find the minimum average number of bits
per character using Shanon's formula. Construct Huffman code tree and derive a code
word set. (10 Marks)
9. Explain Additive and Subtractive color mixing.(04 Marks)
10. Define distributed multimedia system with neat block schematic and also
highlight its features.(10 Marks)
11. Discuss multimedia operating system with respect to CPU management, memory
management, I/0 management and file system management. (08 Marks)
12. With the aid of a diagram, identify the five main stages associated with baseline mode of
operation of JPEG and give a brief description of the role of each page. (08 Marks)
13. Explain the typical structure of an IP network. (08 Marks)
14. Explain Lempel Ziv coding and Lempel ziv Welsh coding. (08 Marks)
15. Explain the meaning of the following terms, relating to compression (i) Lossless and
Lossy compression (ii) Source and Entropy encoding.
16. Code the given string”ABACADABACADABACABAB” using Huffman coding. Derive
Huffman code tree. Determine the savings in transmission band width over normal ASCII
and binary coding.
17. Compare the arithmetic coding and Huffman coding. A message comprising of a string
of characters with probabilities e=0.3, n=0.3, t=0.2, w=0.1,. =0.1 is to be encoded. The
message is “went”. Compute the arithmetic code word.
18. Explain decoding algorithm of static Huffman coding with a flow chart. A series of
messages is to be transferred between two computers over a PSTN.The messages
comprise just the characters A through H.Analysis has shown that the probability of
each character is as follows:
A and B=0.25 and D=0.14, E, F, G, and H=0.055.Use Huffman coding to derive a
codeword set and construct the corresponding Huffman code tree. Derive the
number of bits required for the string”AABBCAD” using the derived codewords.
19. Explain transform encoding procedure related to source encoding.

You might also like