STUPIDSID
1 (a)
Define Chinese Remainder Theorem and its application
5 M
1 (b)
Explain Term Entropy in Information Theory and its significance.
5 M
1 (c)
Describe Fermat's Little Theorem. And its application
5 M
1 (d)
Explain Cyclic Codes.
5 M
2 (a)
Explain Adaptive Huffman encoding techniques. Encode the data pattern "accabbcdaa" using Above technique.
10 M
2 (b)
Compare Symmetric and Asymmetric Cryptography
5 M
2 (c)
Explain various Security Goals.
5 M
3 (a)
Explain convolution code in brief.
10 M
3 (b)
Consider the source probabilities
{0.20, 0.20, 0.15, 0.15, 0.10, 0.10, 0.05, 0.05}
i) Determine the efficient fixed length code for the source.
ii) Determine Huffman code for this source
iii) Compare the two codes and comment.
{0.20, 0.20, 0.15, 0.15, 0.10, 0.10, 0.05, 0.05}
i) Determine the efficient fixed length code for the source.
ii) Determine Huffman code for this source
iii) Compare the two codes and comment.
10 M
4 (a)
Explain DES and give an outline of the algorithm.
10 M
4 (b)
Which of the following g(x) values guarantees that a single bit error is caught? In each case, what is the error that cannot be caught?
i) x+1 ii) x3
i) x+1 ii) x3
10 M
5 (a)
Describe with example Modular Arithmetic, Exponentiation and Congruences.
10 M
5 (b)
Define:-
i) Hamming Weight
ii) Hamming Distance
iii) Syndrome
iv) Linear Code Properties
v) Code Rate
i) Hamming Weight
ii) Hamming Distance
iii) Syndrome
iv) Linear Code Properties
v) Code Rate
10 M
Write short notes on:
6 (a)
RSA
5 M
6 (b)
RLE
5 M
6 (c)
Speech Compression
5 M
6 (d)
Random Number Generation
5 M
More question papers from Information Theory and Coding