SRM VALLIAMMAI ENGINEERING COLLEGE

(An Autonomous Institution)

SRM Nagar, Kattankulathur – 603 203

DEPARTMENT OF
ELECTRONICS AND COMMUNICATION ENGINEERING

QUESTION BANK

VI SEMESTER

EC8002 - MULTIMEDIA COMPRESSION AND COMMUNICATION

Regulation – 2017

Academic Year 2019 – 20 Even

Prepared by

Dr. N. Usha Bhanu, Professor

Mr.S.Senthilmurugan, Assistant Professor

Dr. S. Ramesh, Associate Professor

Page 1 of 10
Q.No Questions
1. Define multimedia.
2. List the multimedia components.
3. Identify communication networks available for multimedia.
4. What is the need for compression?
5. State sampling theorem.
6. Write about quantization.
7. Express the quantization noise of a PCM system.
8. Summarize pitch, period, and loudness.
9. Interpret the audio compression techniques.
10. Distinguish PCM and DPCM.
11. Show the performance of a DPCM scheme can be improved by
utilizing a more accurate version of the previous signal.
12. Illustrate vector quantization.
13. Demonstrate the model of LPC.
14. Pointout the delta modulation is superior to differential pulse code
modulation.
15. Compare LPC and CELPC.
16. Analyze the frequency and temporal masking.
17. Evaluate the vocal tract excitation parameters.
18. Discriminate processing and algorithmic delay in CELPC.
19. Formulate the CELP based standards.
20. Develop the principle of adaptive predictive coding.

1. Describe the following terms,

(i) Sampling theorem for band limited signals, (7)
(ii) Types of quantizer. (6)
2. How would you show your understanding on PCM (13)
waveform coder and decoder with neat sketch and list the
merits compared with analog coders.
3. (i) What is differential pulse code modulation? (3)
(ii) Describe with the aid of a schematic diagram, the (10)
operation of a basic DPCM signal encoder and decoder.
4. Define adaptive PCM and explain ADPCM subband encoder (13)
and decoder with neat schematic.
5. (i) Interpret the third order predictive DPCM signal encoder (7)
and decoder schematic.
(ii) Outline on adaptive predictive coding. (6)
6. Discuss delta modulation system in detail with a neat block (13)
diagram and two forms of quantization errors.
7. (i) Express the perception parameters and associated vocal (7)
tract excitation parameters that are used.
(ii) Summarize the terms relating to speech coders and (6)
explain the meaning.

Page 2 of 10
 8. Demonstrate the LPC encoder and decoder with schematic (13) BTL 3 Applying
diagram.
9. (i) Illustrate the code excited linear predictive coding. (7) BTL 3 Applying
(ii) Discover the difference between LPC and CELPC codec. (6) BTL 3 Applying
Include in your explanation the meaning of waveform
template and template codebook.
10. Explain about the MPEG perceptual encoder and decoder. (13) BTL 4 Analyzing
11. (i) Pointout the three levels of processing used and an (7) BTL 4 Analyzing
applications and typical bit rate of each in MPEG perceptual
coder.
(ii)Infer the vector quantization for speech data compression. (6) BTL 4 Analyzing
12. Analyze the Dolby AC-1, Dolby AC-2, and Dolby AC-3. (13) BTL 4 Analyzing
13. (i) Evaluate the sensitivity of ear and frequency masking. (7) BTL 5 Evaluating
(ii) Assess about the temporal masking with the support of a (6) BTL 5 Evaluating
graph.
14. Invent the principles on which perceptual coders are based (13) BTL 6 Creating
and how they differ from an LPC and CELP coder.

PART - C
1. Determine how better sound quality for the same bit rate can be (15) BTL 5 Evaluating
obtained using a subband coding ADPCM. Give examples of
the bit rates used for the lower and higher subbands and state an
application of this type of codec.
2. Evaluate the difference between LPC and CELP codec. Include (15) BTL 5 Evaluating
the meaning of waveform template and template codebook.
3. Generalize with the aid of schematic diagrams; explain (15) BTL 6 Creating
difference between the forward adaptive bit allocation mode as
used with an MPEG perceptual coder and the fixed bit
allocation mode as used with a Dolby AC-1 coder.
4. Compile the difference between the forward adaptive bit (15) BTL 6 Creating
allocation mode as used with an MPEG perceptual coder and
the fixed bit allocation mode as used with a Dolby AC-1 coder.

UNIT II - IMAGE AND VIDEO COMPRESSION

Graphics Interchange format- Tagged image file format-Digitized documents- Digitized pictures-
JPEG-Video Encoding-Motion estimation –Overview of H.263 and MPEG-2.
PART - A
Q.No Questions BT Competence
Level
1. Identify the significance of GIF and TIFF. BTL 1 Remembering
2. What is the need of EOL in facsimile machine? BTL 1 Remembering
3. How reversible variable length code words reduce the effects of BTL 1 Remembering
transmission errors?
4. Draw MPEG-4 decoder schematic. BTL 1 Remembering
5. Define the term JPEG and MPEG. BTL 1 Remembering
6. Describe the digitized pictures. BTL 1 Remembering
7. Differentiate global and local color table. BTL 2 Understanding
8. Summarize the applications of GIF and TIFF image file formats. BTL 2 Understanding
9. Distinguish lossless and lossy compression techniques. BTL 2 Understanding
10. Interpret B-frame encoding procedure in video compression. BTL 2 Understanding

Page 3 of 10
11. If there is a ZIP code file format means which kind of BTL 3 Applying
compression technique is used to unzip the data?
12. Discover the role of formatter. BTL 3 Applying
13. Demonstrate the H.261 encoding formats. BTL 3 Applying
14. Infer the ways of errors detected in H.263 video compression BTL 4 Analyzing
standard.
15. Classify the MPEG standards. BTL 4 Analyzing
16. Differentiate MPEG-1 and MPEG-2 standards. BTL 4 Analyzing
17. Justify the need of dictionary based algorithm. BTL 5 Evaluating
18. Assess the frame types in video compression. BTL 5 Evaluating
19. Create the expression for DCT of each 8×8 block values. BTL 6 Creating
20. Propose the frame format for JPEG. BTL 6 Creating

PART - B
1. Give a detailed note on the following image file formats:
(i) GIF, (7) BTL 1 Remembering
(ii) TIFF. (6) BTL 1 Remembering
2. Describe with the aid of a schematic diagram about the (13) BTL 1 Remembering
JPEG decoder.
3. Write short notes on,
(i) Pass, vertical, horizontal modes, (7) BTL 1 Remembering
(ii) Digitized pictures. (6) BTL 1 Remembering
4. Examine the DC coefficient, horizontal and vertical spatial (13) BTL 1 Remembering
frequency coefficients relating to the DCT algorithm.
5. (i) Distinguish interlaced and progressive scanning. (7) BTL 2 Understanding
(ii) Interpret video encoding and motion estimation. (6) BTL 2 Understanding
6. Explain in detail about various image compression (13) BTL 2 Understanding
techniques.
7. Summarize the digitization formats, frame types, (13) BTL 2 Understanding
unrestricted motion vectors and error resilience of H.263
video compression standard.
8. Identify the salient features of over scanning and write about (13) BTL 3 Applying
EOL code and its uses.
9. Describe the following terms relating to facsimile machines:
(i) Termination codes, (7) BTL 3 Applying
(ii) Make-up codes. (6) BTL 3 Applying
10. Analyze joint picture expert group encoding process in detail (13) BTL 4 Analyzing
and also mention its applications.
11. (i) Explain the compressed frames of I-frames, P-frames, B- (7) BTL 4 Analyzing
frames and the reasons for their use.
(ii) Differentiate video encoding procedure used with motion (6) BTL 4 Analyzing
vector and prediction vector.
12. Examine the MPEG-2 DCT block derivation with I-fames in (13) BTL 4 Analyzing
the field mode and frame mode.
13. (i) Discriminate between a one dimensional and two (7) BTL 5 Evaluating
dimensional coding schemes.
(ii) Assess motion picture expert group standards. (6) BTL 5 Evaluating
14. Formulate H.263 error tracking scheme, independent (13) BTL 6 Creating
segment decoding and reference picture selection with
independent of segment decoding.

Page 4 of 10
 PART - C
1. Examine the basic mode of operation of GIF. Include in your (15) BTL 5 Evaluating
explanation the size of the color table used, how each pixel
value is sent, and how the receiver knows the image parameters
used by this source.
2. With the aid of a diagram, evaluate the five main stages (15) BTL 5 Evaluating
associated with the base line mode of operation of JPEG and
give a brief description of the role of each stage.
3. (i) Create the MPEG-1 frame sequence and video bit stream (8) BTL 6 Creating
structure.
(ii) Formulate the compression technique which is used for (7)
regenerative sound and digital TV broadcast.
4. (i) Develop how the content based video coding principle is (8) BTL 6 Creating
done in video’s and MPEG-4 coding.
(ii) Invent the compression algorithm used with MPEG-1 differs (7) BTL 6 Creating
from that used in the H.261 standard.

UNIT III - TEXT COMPRESSION

Static and Dynamic Huffman coding – Arithmetic coding –Lempel-Ziv coding – LZW coding
PART - A
BT
Q.No Questions Competence
Level
1. Define the term Entropy encoding. BT1 Remembering
2. List the methods of Statistical entropy coding. BT1 Remembering
3. Point out the features of Differential encoding. BT1 Remembering
4. What is entropy? How entropy is related for the performance
BT1 Remembering
measure of statistical encoding?
5. State the main objectives of lossless and lossy compression
BT1 Remembering
techniques.
6. Give the principle of Run length encoding. BT1 Remembering
7. Why Arithmetic coding is better than Huffman coding? Justify. BT2 Understanding
8. Outline the basic principle of Statistical encoding. BT2 Understanding
9. Compare the principle of adaptive Huffman code and Huffman
BT2 Understanding
Code?
10. When prefix code is called as optimum prefix codes? BT2 Understanding
11. Identify the applications of LZW. BT3 Applying
12. Develop the expression for coding efficiency to entropy. BT3 Applying
13. Choose any one application suited to apply lossy and lossle
BT3 Applying
compression.
14. Explain the features of dictionary based compression algorithm. BT4 Analyzing
15. Distinguish between static and dynamic Huffman coding with
BT4 Analyzing
respect to text compression.
16. Examine the expression for average codeword length L. BT4 Analyzing
17. What is the need of Arithmetic coding in compression? BT5 Evaluating
18. Discuss the need of adaptive Huffman coding. BT5 Evaluating
19. Estimate the Entropy of the symbol A and B with the probability of
BT6 Creating
occurrence as 0.01 and 0.99 respectively.
20. Construct a Huffman code tree for the string of characters
BT6 Creating
AAAABBCD.

Page 5 of 10
 PART - B
1 Define the following:
(i) Source Encoders and destination decoders (6) BT1 Remembering
(ii) Lossless and Lossy compression techniques (7)
2 Describe the features of entropy encoding and statistical (13) BT1 Remembering
encoding techniques with examples.
3 Write short notes on the following :
(i)Run-length encoding (6) BT1 Remembering
(iI) Statistical encoding (7)
4 With the aid of necessary illustrations explain the following:
(i)Entropy encoding (6) BT1 Remembering
(ii)Source encoding (7)
5 Give a detailed note on the Huffman decoding algorithm (13) BT2 Understanding
with an example
6 Explain in detail about Static Huffman coding with (13) BT2 Understanding
necessary tree derivation.
7 Summarize the principle of Arithmetic coding with an (13) BT2 Understanding
example.
8 Describe the following terms relating to statistical encoding : BT3 Applying
(i) Prefix property (3)
(ii) Entropy (2)
(iii) Shannon’s formula (5)
(iv) Coding Efficiency (3)
9 Identify the salient features of LZW algorithm and explain (13) BT3 Applying
the encoding and decoding of the string BABAABAAA .
10 Analyze the steps of Shannon- Fano Coding and calculate (13) BT4 Analyzing
the coding efficiency for the symbols a1,a2, a3, a4, a5 with
the probabilities 0.4, 0.19, 0.16, 0.15, 0.1.
11 Examine the need of Dynamic Huffman coding for the string (13) BT4 Analyzing
ABRACADABRA and construct the code word.
12 Find Huffman code word of the given text (13) BT4 Analyzing
“AAAAAAAAAABBBBBCCCSS” by using static Huffman
tree. Calculate Entropy and derive the average number of
bits per character for code word?
13 Examine the procedure of LZW coding algorithm and how it (13) BT5 Evaluating
is different from LZ algorithm.
14 Messages comprising Seven different characters, A through BT6 Creating
G are to be transmitted over a data link, analysis has shown
that the relative frequency of occurrence of each character is
A 0.10, B 0.25, C 0.05, D 0.32, E 0.01, F 0.07, G 0.2.
a) Derive the entropy the messages (3)
b) Use static Huffman coding to derive a suitable set of
code words. (3)
c) Derive the average number of bits per code word for four
code word set to transmit a message. (3)
d) Calculate efficiency and redundancy. (4)

Page 6 of 10
 PART - C
1. A series of messages is to be transferred between two BTL 6 Creating
computers over a PSTN. The message consists of the
characters A through H with the probability of occurrence as
follows:
A and B = 0.25, C and D= 0.14, E, F, G and H= 0.055.
(i) Use Shannon’s formula to derive the minimum average (3)
number of bits per character.
(ii) Use Huffman coding to derive a codeword set and prove
this is the minimum set by constructing the (6)
corresponding Huffman code tree.
(iii) Derive the average number of bits per character for the
codeword and compare it with the entropy of the (6)
messages.
2. A series of messages is to be transferred between computers. BTL 6 Creating
The message comprises of the characters a through f. The
probability of occurrence of the characters a through f are 0.4,
0.2, 0.1, 0.1, 0.1, 0.1 respectively.
(i) Use Huffman coding procedure to derive a codeword and (10)
also obtain the average codeword length.
(ii) Calculate coding efficiency and redundancy. (5)
3. With necessary illustrations explain the Dynamic Huffman (15) BTL 5 Evaluating
coding procedure for the encoding of the string: This is simple.
4. Justify the importance of arithmetic encoding algorithm and (15) BTL 5 Evaluating
encode the string with the probabilities of the character
“went$”. The probabilities are : e=0.3, n=0.3, t=0.2, w=0.1,
$=0.1

UNIT IV - GUARANTEED SERVICE MODEL

Best Effort service model – Scheduling and Dropping policies – Network Performance Parameters –
Quality of Service and metrics – WFQ and its variants – Random Early Detection – QoS aware
Routing – Admission Control – Resource Reservation – RSVP - Traffic Shaping Algorithms –
Caching – Laissez Faire Approach - Possible Architectures – An Overview of QoS Architectures.
PART - A
Q.No Questions BT Competence
Level
1. Point out the features of best effort service. BTL 1 Remembering
2. Outline the limitations of best effort service. BTL 1 Remembering
3. Define packet jitter. BTL 1 Remembering
4. What are the two principal characteristics of RSVP? BTL 1 Remembering
5. List out the schemes for streaming stored multimedia
BTL 1 Remembering
communication.
6. Outline the link scheduling discipline methods. BTL 1 Remembering
7. Summarize the important policing criteria for the packet flow in
BTL 2 Understanding
the network.
8. Discuss the method of leaky bucket policing mechanisms. BTL 2 Understanding
9. Explain the role of the WFQ in network QoS. BTL 2 Understanding
10. Explain the different parameters related to QoS. BTL 2 Understanding
11. Illustrate the need of call admission in providing network
BTL 3 Applying
service.

Page 7 of 10
12. Interpret the architecture developed to provide guaranteed QoS
BTL 3 Applying
in the Internet.
13. Identify the need for per- hop behavior of Diffserv network. BTL 3 Applying
14. Examine the functional elements of Diffserv architecture. BTL 4 Analysing
15. Categorize the difference between traffic shaping and traffic
BTL 4 Analysing
policing.
16. Choose some of the difficulties associated with the intserv model
BTL 4 Analysing
and per-flow reservation of resources.
17. Discuss the need of Laissez Faire Approach to support
BTL 5 Evaluating
multimedia communication in the Internet.
18. Compare the features of best effort and differentiated services. BTL 5 Evaluating
19. Elaborate the principle of soft state in RSVP. BTL 6 Creating
20. Develop a model for Diffserv traffic classification and
BTL 6 Creating
conditioning.

PART - B
1 (i) List the attributes of limitations of Best- effort service (6)
in the context of Internet phone applications.
BTL 1 Remembering
(ii) With necessary diagrams explain about FIFO queuing (7)
abstraction.
2 Mention the different Scheduling mechanisms and explain (13)
BTL 1 Remembering
in detail with necessary diagrams.
3 With necessary illustrations write a detailed note on (13)
BTL 1 Remembering
Policing mechanisms in multimedia network.
4 Explain intserv model and per-flow reservation of (13)
resources. BTL 1 Remembering

5 Write short notes on the following:

(i) Integrated services. (6) BTL 2 Understanding
(ii) Differentiated services. (7)
6 Summarize the important points on :
(i) Priority Queuing (3)
BTL 2 Understanding
(ii) Round robin and WFQ (3)
(iii) Leaky bucket policer (7)
7 Explain in detail the principle and applications of RSVP. (13) BTL 2 Understanding
8 Identify the basic functional elements of Differentiated (13)
services architecture with an example network and explain BTL 3 Applying
with necessary diagrams.
9 (i) Compare the mechanism of traffic shaping and traffic
policing needed to ensure QoS in multimedia
networks. (6) BTL 3 Applying
(ii) Discuss about Leaky bucket algorithm in traffic
policing. (7)
10 Examine the following :
(i) Traffic classification and conditioning in Diffserv (6)
BTL 4 Analyzing
networks.
(ii) (ii) Per- Hop behaviors in Diffserv architecture. (7)
11 Analyze the strategies used to provide guaranteed QoS (13)
BTL 4 Analyzing
with an example audio applications in the network.
12 Examine the goal and applications of integrated and (13)
BTL 4 Analyzing
differentiated services.

Page 8 of 10
 13 Criticize on the following:
(i) Quality of Service (QoS) and its related parameters. (3)
(ii) Develop a QoS Layer model and discuss its various (10) BTL 5 Creating
services and applications.
14 Elaborate with necessary diagrams on the following:
(i) Call Setup process (6) BTL 6 Evaluating
(ii) Steps in Call Admission (7)

PART - C
1. (i) Develop a scenario of sending multimedia application (7) BTL 6 Creating
over the Internet and discuss the phenomenon of various
scheduling schemes.
(ii) Explain the methods of dropping policies to manage (8)
network traffic.
2. Discuss in detail the various service architectures to QoS (15) BTL 6 Creating
support for multimedia applications over the Internet with
diagrams.
3. Derive the expression for drop probability function in RED (15) BTL 5 Evaluating
for the arrival of packets in a FIFO queue by considering the
minimum and maximum threshold length of packets arriving
at the router to avoid congestion in the multimedia networks.
4. Design a scenario for sending two 1Mbps audio applications (15) BTL 5 Evaluating
transmitting their packets over 1.5 Mbps link. Apply the
concept of resource reservation and traffic characterization to
ensure guaranteed QoS in the network. Explain with
necessary illustrations.

UNIT V MULTIMEDIA COMMUNICATION

Stream characteristics for Continuous media – Temporal Relationship – Object Stream Interactions,
Media Levity, Media Synchronization – Models for Temporal Specifications – Streaming of Audio
and Video – Jitter – Fixed playout and Adaptive playout – Recovering from packet loss – RTSP ––
Multimedia Communication Standards – RTP/RTCP – SIP and H.263.
PART - A
Q.No Questions BT Competence
Level
1. Define Streaming Multimedia. BTL 1 Remembering
2. List the characteristics of continuous media streams BTL 1 Remembering
3. Draw RTP packet header format BTL 1 Remembering
4. What is the need of playout buffer? BTL 1 Remembering
5. State Jitter. BTL 1 Remembering
6. Write about Control Flow-based Specification BTL 1 Remembering
7. Differentiate Fixed and Adaptive Playout Delays BTL 2 Understanding
8. Summarize the Objective Temporal Relations BTL 2 Understanding
9. Interpret the Chronology of Video Standards BTL 2 Understanding
10. Distinguish Inter-object and Intra-Object Synchronization BTL 2 Understanding
11. Show the performance Improvements of H.263 over H.261 BTL 3 Applying
12. Illustrate Temporal Relation BTL 3 Applying
13. Demonstrate the SIP message models BTL 3 Applying
14. Point-out the SIP entities. BTL 4 Analyzing

Page 9 of 10
15. Compare Live Synchronization and Synthetic Synchronization BTL 4 Analyzing
16. Classify the media Synchronization Units BTL 4 Analyzing
17. Evaluate the levels of multimedia Synchronization BTL 5 Evaluating
18. Assess the overall functions of RTSP methods. BTL 5 Evaluating
19. Formulate the RTCP message types BTL 6 Creating
20. Propose Multimedia applications BTL 6 Creating
PART - B
1. Describe the following terms,
(i) Classification of Synchronization and Units (10) BTL 1 Remembering
(ii) List out the RTSP Applications. (3) BTL 1 Remembering
2. What is the transport protocol being used by RTSP and (13) BTL 1 Remembering
explain the working of RTSP with methods.
3. (i) Write the different Specifications of Synchronization (3) BTL 1 Remembering
(ii) Describe the objective levels of Temporal Relations (10) BTL 1 Remembering
4. Describe with message types and packet format of Real- (13) BTL 1 Remembering
Time Transport Control Protocol.
5. (i) Outline the characteristics of Streaming media (7) BTL 2 Understanding
(ii) Compare RTSP and HTTP. (6) BTL 2 Understanding
6. Discuss in detail about the Content Distribution Networks (13) BTL 2 Understanding
7. (i) Identify the working principle of Adaptive Streaming and (7) BTL 2 Understanding
DASH.
(ii) Summarize the key distinguishing features of Streaming (6) BTL 2 Understanding
stored video.
8. Demonstrate the Synchronization of multimedia objects with (13) BTL 3 Applying
respect to four-level system.
9. (i) Illustrate the client-side buffering in Streaming Stored (7) BTL 3 Applying
Video.
(ii) Discover the difference between UDP Streaming and (6) BTL 3 Applying
HTTP Streaming.
10. Explain about the Streaming stored video over HTTP/TCP. (13) BTL 4 Analyzing
11. Examine the goal of streaming live audio/video and Real- (13) BTL 4 Analyzing
Time Interactive Audio/Video.
12. Analyze the client-side buffering for Video Streaming. (13) BTL 4 Analyzing
13. (i) Interpret how RTP is designed to handle real-time traffic (8) BTL 5 Evaluating
on the Internet.
(ii) Assess the Packet loss for different fixed playout delays. (5) BTL 5 Evaluating
14. Compile the call establishment principles on Session (13) BTL 6 Creating
Initiation Protocol with neat sketch.

PART - C
1. Compile a video transmission over Ethernet using H.263 codec (15) BTL 6 Creating
with compression ratio and Peak signal to noise ratio.
2. Develop the design goal and fundamental principle of Real (15) BTL 6 Creating
Time Protocol and explain the protocol formats and features.
3. Evaluate the role of a SIP registrar. Explain how the role of an (15) BTL 5 Evaluating
SIP registrar is different from that of a home agent in Mobile
IP.
4. Design Protocols for Real-Time Conversational Applications (15) BTL 5 Evaluating
with message types and packet formats.

Page 10 of 10