INTEGRAL UNIVERSITY, LUCKNOW

Department of Computer Application

Session 2019– 2020
Assignment-2
Course: BCA 2nd Year Subject Name: Multimedia Systems Subject Code: CA -202

Q1.What do you mean by arithmetic coding? What are the features which make it different from
Huffman and Shannon Fano compression?

Q2. What are the drawbacks of arithmetic coding schemes? How are they overcome?

Q3. List all the steps required to construct the Huffman Tree. How is Huffman Tree more effective than
Shannon-Fano Tree?

Q4.Suppose a message contains four symbols. The symbols and their frequency is given below:

Symbol Frequency

‘e’ 60
‘a’ 20
‘b’ 15
‘d’ 5

Q5. Consider the text string “WYS*WYGWYS*WYWWYSG”. Show all the steps
of LZ78 compression.