MU Information Technology (Semester 4)
Information Theory and Coding
May 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Write a note on convolution code.
4 M
1(b) State Fermat's little theorem and its applications
4 M
1(c) Define entropy and explain types of entropy
4 M
1(d) Explain cyclic codes.
4 M
1(e) What is compression. List different compression algorithm.
4 M

2(a) Name the source coding technique used in the following types of files and Classify them as lossy or lossless.
i) .Zip ii) .jpg iii) .mpg iv) .bmp v) .gif
10 M
2(b) For (7,4) cyclic code, find out the generator matrix if G(D) = 1+D+D3
10 M

3(a) Explain Diffie-Hellman algorithm. Which attack is it vulnerable to?
10 M
3(b) Construct Huffman code for the given symbols {x1, x2...x8} with probabilities P(x) = {0.07, 0.08, 0.04, 0.26, 0.14, 0.19, 0.07, 0.25}. Find coding efficiency.
10 M

4(a) Explain LZW compression with example.
10 M
4(b) State Chinese Remainder theorem. Using it solve for X.
X=1 MOD 2
X=2 MOD 3
X=2 MOD 5
10 M

5(a) What do you mean by symmetric key cryptography? Explain DES in detail.
10 M
5(b) Define
i) Hamming weight
(ii) Hamming Distance
(iii) Syndrome
10 M

Write short notes on
6(a) RSA
5 M
6(b) RLE
5 M
6(c) Security Goals
5 M
6(d) Digital Signature
5 M



More question papers from Information Theory and Coding
SPONSORED ADVERTISEMENTS