Académique Documents
Professionnel Documents
Culture Documents
SIES GRADUATE SCHOOL OF TECHNOLOGY
DEPARTMENT OF ELECTRONICS & TELECOMMUNICATION ENGINEERING
Sub: Data Compression and Encryption Sem: VII
Class: B. E. (Elect. & Telecom.) Date:
Assignment 1
Q.1 Explain hybrid speech coders. In speech coding how the quality of speech can be improved by
using CELP and other sinusoidal coders over LPC.
Q.2 Describe the µ‐Law and A‐Law Companding.
Q.3 A source and its letters form an alphabet A= {a1, a2, a3, a4} with probabilities P = {0.15, 0.06,
0.24, 0.05, 0.5} respectively. Calculate: ‐ ‐
1. Standard Huffman code.
2. Minimum variance Huffman code
3. Variances in both codes and compare them.
4. Average length and redundancy of both the codes.
5. Draw the binary code tree for both the codes and also prove that they are prefix codes.
Q. 4 Explain the concept of static and dynamic dictionary. Show the encoding with example using LZ
77.
Q.5 Explain the concept of static and adaptive dictionary. Explain with a suitable example the
encoding using LZ77.
Q.6 Write a note on: Extended Huffman Codes.
Q.7 Write a note on: MPEG Audio standard.
Q.8 Explain the terms "Frequency Masking" and "Temporal Masking" with respect to Audio
Compression.
Q.9 Discus the drawbacks of statistical methods.
Q.10 A source emits five symbols a, b, c, d, e with probabilities 0.25, 0.25, 0.25, 0.125, 0.125
respectively. Calculate
1. Entropy of Source.
2. Find Huffman Code using standard method.
3. Find Shannon Fano Code.
4. Find Average Length of Code and redundancy.
Q.11 An Initial dictionary consists of letters a, b, r, y, z encode the following message with LZW
algorithm: ‐ "azbarzarrayzbyzbarrayarzvay'
DCE II Half 2010 Page 1
GKB
Q.12 40 Draw the Adaptive Huffman tree for the string 'xyxwz'... Give the encoding and decoding
process for the same.
Q.13 Compare lossy compression and lossless compression giving examples.
Q.14 Describe the Shannon‐Fano coding with an example.
Q.15 Explain the adaptive Huffman coding. Describe with flowcharts the with various procedures
involved.
Q.16 Compare the LZ77 and LZ78 approaches for adaptive dictionary.
Q.17 Explain the ADPCM Audio Compression Technique.
Q.18. List the 10 application for text, audio, video and suggest the appropriate compression
technique.
Q.19 Draw and explain MPEG audio formats.
Q.20 write a note on: Linear predictive coding,
Q.21 A source emits letters from an alphabet A= {m, n, o, p, q} with probabilities {0.1, 0.3, 0.3, 0.15,
0.15} respectively.
1. Find the Shannon Fano code for the above source.
2. Find the Huffman code using the minimum variance method.
3. Compare the average length and redundancies for both the codes.
Q.22 With, S= {w, x, y, z} and P= {0.4, 0.3, 0.1, 0.2} respectively, we encode the message 'w x y y z'
.Using arithmetic coding generate a tag for encoding and also decipher the tag to decode the
sequence.
Q.23 Given an initial dictionary consisting of letters a, b, r, y, \ b. Encode using LZW algorithm:
a\bbar\barray\bby\barrayar\bbay. Also decode using the encoding sequence to get back the string.
Q.23 Encode the string 'mnop mnop ponm' using LZ78. What are the limitations of this method?
How does LZW overcome these limitations?
Q.24 What is the significance of modeling and coding with respect to data compression? Discuss the
various popular models used.
Q.25 Compare arithmetic with Huffman coding.
Q.26 A source and its letters form an alphabet A = {a1, a2, a3, a4, a5} with probabilities P = {0.15,
0.06, 0.24, 0.05, 0.5}.
Calculate ‐
1. Standard Huffman code
2. Minimum variance Huffman code
3. Average length and redundancy of both the codes.
DCE II Half 2010 Page 2
GKB
4. Draw the Binary Code Tree for both the codes and prove that they are prefix codes.
Q.27 With S = {h, i, j, k} and P{ 0.6, 0.2, 0.15, 0.05}, respectively, encode the message 'h, h, i, k, j’. Using
arithmetic coding generate a tag for encoding and also decipher the tag for decoding the sequence.
Q.28 A sequence is encoded using LZW and the initial dictionary is (a, \b, r, t)
(i) Output of the LZW encoder is 3, 1, 4, 6, 8, 4, 2, 1,2, 5, 10,6, 11, 13,6 decode it.
(ii) Encode the decoded sequence using the same initial dictionary.
Q.29 Explain the Adaptive Huffman coding process for the string mnompn... Also give the encoding
and decoding process for the same.
Q.30 For a given probability model decode a sequence of length 10 with a tag of 0.63215699. P (a1)
= 0.2, P (a2) = 0.3 and P (a) = 0.5. Use arithmetic coding.
Q.31 Given an initial dictionary consisting of letters a, b, C, r, y. Encode using LZW algorithm
acbarcarraycbycarray.
Q.32 Distinguish between scalar and vector quantization. Explain K‐Means algorithm.
Q.33 A source and its letters form an alphabet A = {a, b, c, d, e} with probabilities P= {0.15, 0.05, 0.25,
0.35, 0.20} respectively.
Calculate:‐
1. Standard Huffman code
2. Minimum variance Huffman code
3. Average length and redundancy of both the codes
4. Draw the binary code‐tree for both the codes and also prove that they are prefix codes.
Q.34 With S = {m, n, o, p} and P={0.4, 0.3, 0.1, 0.2 } respectively, we encode the message 'pmnop'
using arithmetic coding generator tag for encoding and also decipher the tag to decode the
sequence.
Q.35 Taking an alphabet string, explain how LZ78 encoding is done. Also for the same string explain
the LZW encoding process. Write the codes for both the methods.
Q.36 What are the sifting properties in Adaptive Huffman Codes?
Q.37 With M= {a, b, c, d} and P = {0.5, 0.3, 0.1, 0.2}, respectively, we encode the message, 'cbdda'.
Using arithmetic coding generate the tag for encoding and also decipher the tag to decode the
sequence.
Q.38 Given an initial dictionary consisting letters (a, b, c, d, e, f) encode using LZW algorithm
'addaeabccdaceaeafccdeafccde'...Also decode using the encoding sequence to get back the string.
DCE II Half 2010 Page 3
GKB
SIES GRADUATE SCHOOL OF TECHNOLOGY
DEPARTMENT OF ELECTRONICS & TELECOMMUNICATION ENGINEERING
Sub: Data Compression and Encryption Sem: VII
Class: B. E. (Elect. & Telecom.) Date:
Assignment 2
Q.1 Describe the different approaches for Image compression.
Q.2 Describe the classical encryption techniques.
Q.3 Explain the still image compression technique used in JPEG.
Q.4. Show DES decryption is an inverse of DES encryption .What is 'meet in the middle' attack? Why
is the middle part in triple DES 'decryption'?
Q.5 Write a note on: Data encryption standards and various algorithms.
Q.6 Explain different types of Cipher Modes of Operation.
Q.7 Explain the Working of DES algorithm in details.
Q.8 Discuss the various standards of MPEG video.
Q.9 Define and differentiate data compression and data encryption.
Q.10 Differentiate image compression and video compression.
Q.11 Explain with example the significance of Gray codes for image compression.
Q.12 Describe the features of video compression as compared to Image compression. Explain the
MPEG industry standard for video compression.
Q.13 Explain different types of block cipher modes of operations.
Q.14 Why in DCT more popular for image compression? How is it used in JPEG?
Q.15 Write a notes on: RSA Algorithm.
Q.16 Write a notes on: Key distribution
Q.17 Explain scalar quantization.
Q.18 Draw and explain JPEG image format.
Q.19 Describe the Data Encryption standard
Q.20 Classify security attacks and security goals (services). Also relate them.
Q.21 Justify the use of PCM for image compression.
Q.22 Explain how key management and distribution is a problem and how is it solved.
Q.23 Explain hybrid use of cryptography to send large file over networking for efficiency.
Q.24 What are 'active' and 'passive' attacks on the security of a system.
Q.25 Write a note on: Stream Ciphers
DCE II Half 2010 Page 4
GKB
Q.26 What are the essential ingredients of symmetric cipher.
Q.27 What is the role played by the KDC in symmetric encryption. Explain.
Q.28 Write a note on: Fractal Image' Compression
Q.29 What are the different types of DES prevalent today. How is the security aspect maintained in
DES.
Q.30 Explain different types of Cryptographic Techniques.
DCE II Half 2010 Page 5
GKB
SIES GRADUATE SCHOOL OF TECHNOLOGY
DEPARTMENT OF ELECTRONICS & TELECOMMUNICATION ENGINEERING
Sub: Data Compression and Encryption Sem: VII
Class: B. E. (Elect. & Telecom.) Date:
Assignment 3
Q.1 Explain various virus countermeasures.
Q.2 Explain the Chinese Remainder theorem along with an example.
Q.3 Compare the Conventional and Public Key encryption.
Q.4 Write a note on: Digital Immune System
Q.5 Write a note on: Message authentication codes and its uses.
Q.6 Justify the need for "Cryptography". Explain different types of Cryptographic Techniques.
Q.7 write a note on: One way has function
Q.8 Write a note on: Digital Signature Standards and its features
Q.9 Explain firewall characteristics. Also discuss types of firewalls.
Q.10 Explain anyone MAC standard.
Q.11 Write a note on: Elliptic curve cryptography.
Q.12 Compare symmetric and public key cryptography.
Q.13 Discuss types of viruses in detail.
Q.14 What is the significance of 'prime numbers' in public key cryptography. Explain the RSA
algorithm with a suitable example.
Q.15 Discuss the various steps involved in the Key Exchange in symmetric encryption using Key
Distribution Center.
Q.16 Suggest a suitable scheme for secure communication between users A and B covering issues of
confidentiality and authentication. Justify your choice.
Q.17 Discuss security of HASH and MAC functions.
Q.18 Discuss the difference between Hash and MAC codes used for authentication.
Q.19 What are the different ways in which secret keys can be exchanged between 2 entities.
Q.20 Explain RSA algorithm. Using RSA, perform encryption and decryption for p = 7, q = 11, e = 17,
M = 8.
Q.21 Explain the Diffie‐Hellman Key exchange process.
Q.22 Explain Certificate based & Biometric authentication.
Q.23 write a note on: HMAC design objectives and structures
DCE II Half 2010 Page 6
GKB
Q.24 Explain various intrusion detection techniques.
Q.25 Discuss architecture for distributed intrusion detection
Q.26 write a note on: password management
Q.27 Explain nature of viruses and virus structure.
DCE II Half 2010 Page 7