Download GTU BE/B.Tech 2018 Winter 6th Sem New 2161603 Data Compression And Data Retrival Question Paper

FirstRanker.com

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER-VI (NEW) EXAMINATION - WINTER 2018

--- Content provided by‍ FirstRanker.com ---

Subject Code:2161603

Subject Name:Data Compression and data Retrival

Time: 02:30 PM TO 05:00 PM

Instructions:

1. Attempt all questions.

--- Content provided by​ FirstRanker.com ---

2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q1

1. Define following terms:
   1. Entropy of Source
   2. Compression Ratio

   --- Content provided by‌ FirstRanker.com ---

   3. Modeling
   (03)
2. Explain Different types of models in data compression. (04)
3. How to measure the performance of multiple Data Compression algorithms? Explain parameters to select one algorithm out of many. (07)

Q2

--- Content provided by‌ FirstRanker.com ---

1. Define following terms:
   1. Uniquely Decodable Code
   2. Prefix Code
   3. Instantaneous Code
   (03)
2. An alphabet S ={ al, a2, a3 ,a4 ,a5} symbols with probabilities as P(al)=0.4, P(a2)=0.3, P(a3)=0.2, P(a4)=0.09, and P(a5)=0.01, Find out Huffman code, source entropy, average length and compression ratio. (04)

--- Content provided by‌ FirstRanker.com ---

3. Explain the Encoding process of Adaptive Huffman Algorithm. (07)

OR

1. How Extended Huffman reduces code average length Code? Prove using alphabet A={al,a2,a3} with probability 0.95,0.03 and ,0.02 respectively. (03)
2. Explain Sampling and Quantization of an Audio Signal (04)
3. Differentiate following:
   1. Lossy Compression vs. Lossless Compression

   --- Content provided by​ FirstRanker.com ---

   2. Statistical vs. Dictionary based compression
   (07)

Q3

1. Consider a source containing 26 distinct symbols [A-Z]. Encode given sequence of symbols using Adaptive Huffman algorithm. Symbol Sequence: MUMMY (03)
2. Compare Arithmetic Coding and Huffman Coding Algorithms for text compression. (04)

--- Content provided by‍ FirstRanker.com ---

3. Given source with probabilities of symbols as P(A)=0.45 P(B)=0.25, P(C)=0.15, P(D)=0.15. Perform encoding of string "BCADB" using arithmetic coding and generate tag. (07)

OR

1. Design a minimum variance Huffman code for a source that put out letter from an alphabet A={ aj, a;, a3, as, as, ag} with P(a;)=P(a2)=0.2, P(a3)=0.25, P(a4)=0.05, P(as)=0.15,P(as)=0.15.Find the entropy of the source, avg. length of the code and efficiency. Also comment on the difference between Huffman code and minimum variance Huffman code. (03)
2. Compare & contrast:
   1. LZ78 and LZW Algorithms.
   2. Static Dictionary Based Algorithm vs. Dynamic Dictionary Based Algorithm

   --- Content provided by⁠ FirstRanker.com ---

   (04)
3. Encode and Decode following sequence using LZW Coding technique. Sequence: ABABABAB (07)

Q.4

1. Compare Uniform Quantization with Non Uniform Quantization. (03)
2. Using given probabilities P(A)=0.2, P(B)=0.2, P(C)=0.2, P(D)=0.4. Decode tag 0.14496 for atleast five symbols. (04)

--- Content provided by​ FirstRanker.com ---

3. Explain LZ78 encoding procedure with suitable example. (07)

Q.5

1. Find the storage size of Gray scale video clip of 20 second duration with 640x480 resolution @ 30 FPS. (03)
2. Explain Vector Space model for XML Retrieval. (04)
3. Explain Prediction with partial match method. (07)

--- Content provided by FirstRanker.com ---

OR

1. Explain significance of discrete cosine transform (DCT) in JPEG Compression . (03)
2. What is significance of Quantization and Zigzag Coding in JPEG Compression? (04)
3. Draw and Explain Block diagram for Baseline JPEG Algorithm. (07)

Date:27/11/2018

--- Content provided by⁠ FirstRanker.com ---

Total Marks: 70

FirstRanker.com