Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 8th Semester (Eight Semester) 2015-16 EIT 082EEC 069A Multimedia System Question Paper
(Following Paper ID and Roll No. to be ?lled in your
Answer Books)
RollNoIl 11117711
B.TECI-I.
Theory Examination (Semester-VIII) 2015-16
MULTIMEDIA SYSTEM
Time : 3 Hours Max. Marks : 100
Section-A
Q.l. Attempt all parts. All parts carry equal marks. Write
answer of each part in short. (2XI0=20)
(a) What is meant by the terms multimedia and
hypennedia?
(b) Discuss Why IOSSY data com ression iS sometimes
p
preferred over 10881688.
(0) What is meant by the terms static media and dy-
namic media? Give two examplw of each type of media.
(d) Why ?le or data compression is necessary for multime-
dia activities?
(1) P.T.O.
106/3'04/120/3000
(e)
(f)
(E)
(h)
(i)
G)
How is a basic MIDI message structured?
What is hypertext? What is the architecture of hypextext
document?
Discuss the bene?ts o??emed by compression schemes in
designing systems.
Write the di??erence between bitmap and vector drawn
images.
Compare the consnast JPEG and MPEG
Write a short note on characteristics of sound.?
Section-B
Q.2. Attempt any ?ve questions from this section.
(a)
(b)
(C)
(10X5=50)
What are the key differences among I-mees, P-Frames
and B-Frames?
What motion compensation is used for in MPEG video
compression? Explain in brief.
What is meant by the terms frequency and temporal
masking of two or more audio signals? What is the
cause of this masking?
(2)
10604/120/3000
(d)
(e)
(f)
(E)
(h)
Attempt any two questions from this section.
(i) Elaborate BMP image ?le format.
(ii) What is fractal compression technique for image
compression?
Brie?y describe the four basic types of data redundancy,
whose data compression algorithms can be applied to
audio, image and video signals.
What are multimedia authon'ng tools ? Explain any three
in brief.
What is multimedia document architecture? What is its
relevance in this era of internet? Explain in brief.
With the help of an example discuss Hu??man coding as
text compression technique.
Section-C
(lSXZ=30)
Q3. Given the following suing as input: ABRACADABRA with the
initial dictionary below, encode the sequence with the LZW
algorithm showing the inteimediate steps
Index Enuy
l A
2 B
3 C
4 D
5 R
(3) P.T.O.
106M4/120/3ooo
Q4. Consider the following DNA fragment:
...GTACCCGACACTTCCGTCCCCTTC... Assume that the
frequencies of symbols in the rest of the sequence are the
same as in this ?agment. Estimate the probabilities of each
symbol {A, G, T, C} and hence derive the Huffman code
for each. Estimate the average number of bits per symbol
required to encode the sequence using Huffman code un-
der these circumstances.
Q5. Write Short Note on:
(a) Arithmetic encoding
(b) Run length encoding
(c) 1.2 and LZW
(4)
106/304/120/3000
This post was last modified on 29 January 2020