Sunteți pe pagina 1din 1

Department of Computer Engineering

Data Compression (CE 705)


Assignment No: 1 Information Theory Concepts
Date: 28/08/2010 Last Date of Submission: 11/09/2010
Questions:
1. Compare & Differentiate Data Compression & Encryption process .(5)
2. Compare Fix length coding & Variable length coding. (4)
3. If Data completely fits into a model then do we require coding?(Y/N) justify your answer with
example. (4)
4. How to choose modelling & coding algorithms? Does if depend on nature of data? (5)
5. A Code that is not prefix but is can be UDC Code. (T/F)Justify your answer with example. (5)
6. What is an instantaneous code? Answer with example. (4)
7. Write a algorithm for checking whether the code is UDC or not.(5)
8. Write a algorithm for checking whether the code is PREFIX or not.(5)
9. A source contains 2n symbols with equal probability. Prove that if error rate is more than (1/n)%,
then no data can be recovered with accuracy. (5)
10. Check whether the code are PREFIX & UDC or not: (5)
a. {00,010,001,0001}
b. {0,100, 1001}
c. {10,010,0110}
d. {111,1110,10111}
e. {0,10,110,1110,11110}
11. Derive equations for Compression Ratio, Redundancy Removed & Redundancy still there after
compression.(3)
12. Classify Data compression Algorithms. (4)
13. Is it possible that a code for a symbol remains same all the times or it can change also? Justify.
(4)
14. If there are 2n symbols with equal probability and initially n bit is assigned then Huffman does
not compress the data. (T/F) Justify the answer. (5)
15. Define terms: (5)
a. Variable Length Code (VLC)
b. Fixed Length Code (FLC)
c. Variable Code (VC).
d. Prefix Code
e. UDC Code
16. Find 1st Order Entropy , Average Length, Compression Ratio, Redundancy ( Removed)
,Redundancy (Still There) for following set of Data:
a. A(0.9), B(0.1)
b. A(0.7), B(0.3)
c. A (0.2), B (0.2), C (0.2), D (0.2), E (0.2).
d. A (0.4), B (0.3), C (0.15), D (0.1), E (0.05).
e. A (0.5), B (0.25), C (0.125), D (0.0625), E (0.0625).
f. A(0.45), B (0.45), C(0.1)
Comment on the results in each case. Numbers in brackets denotes probabilities. Assume 8 Bit ASCII
code initially.(2-3 for each)

S-ar putea să vă placă și