STUPIDSID
1 (a)
Discuss the basic data compression techniques with suitable examples
5 M
1 (b)
Explain predictive coding technique for compression
5 M
1 (c)
Explain Chinese remainder algorithm with example.
5 M
1 (d)
What is the difference between MDC and MAC? Explain criteria for cryptographic hash function
5 M
2 (a)
Design a minimum variance Huffman code for a source that put out letter from an alphabet A={a1,a2,a3,a4,a5,a6} with P(a1)=P(a2)=0.2, P(a3=0.25, P(a4=0.05, P(a5)=0.15, P(a6)=0.15
Find the entropy of the source, avg. length of the code and efficiency. Also comment on difference between Huffman code and minimum variance Huffman code.
Find the entropy of the source, avg. length of the code and efficiency. Also comment on difference between Huffman code and minimum variance Huffman code.
10 M
2 (b)
Encode the following sequence using the LZ-77 algorithm barrayarbbybbarrayarbbay. Assume you have a window size of 15 with look
ahead buffer of size 7. Further more assume that c(a)=1,c(b)=2 , c(b)=3
c(r)=4, c(y)=5.
10 M
3 (a)
Discuss the drawbacks of different conventional method in audio compression. Explain silence compression in lossy audio compression technique.
10 M
3 (b)
Describe the format of \mu -law encoder and decoder specified by G.711. Find out the codeword for - 656 input sample using \mu-law encoder specified
by G.711
Give difference between \mu-law and A law companding.
Give difference between \mu-law and A law companding.
10 M
4 (a)
Explain the attack on double DES. Discuss Triple DES with three keys and
triple DHS with two keys.
10 M
4 (b)
Explain steganography with example Distinguish between steganography and
Cryptography.
10 M
5 (a)
State Fermat's little theorem and Euler's theorem.
Find multiplicative inverse of following without using extended euclidean algorithm.
(i) 8-11 mod 77 (ii) 7-1 mod 15
Also explain the use of Euler's theorem in RSA cryptosystem.
Find multiplicative inverse of following without using extended euclidean algorithm.
(i) 8-11 mod 77 (ii) 7-1 mod 15
Also explain the use of Euler's theorem in RSA cryptosystem.
10 M
5 (b)
Explain digital signature using RSA with example.
10 M
6 (a)
Write a short note on secure Electronic payment system
10 M
6 (b)
Discuss Intruders, viruses and worm in detail.
Also explain logical bomb and trojan horse
Given difference between viruses and worms
Also explain logical bomb and trojan horse
Given difference between viruses and worms
10 M
Attempt any two.
7 (a)
JPEG in image compression
10 M
7 (b)
MPEG video standard
10 M
7 (c)
IDEA
10 M
7 (d)
Biometric Authentication
10 M
More question papers from Data Compression and Encryption