B.TechSemester 62024-25Data CompressionBCS064

Data Compression (BCS064) - AKTU Question Paper 2024-25

B.Tech · Semester 6 · Free PDF Download

This is the official AKTU Data Compression Previous Year Question Paper for B.Tech Semester 6, academic session 2024-25. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 6
Session:2024-25
University:AKTU / UPTU

Rate this paper

Questions Asked in 2024-25

Data Compression (BCS064) — complete question paper · 70 marks · 3 Hours

Section AAttempt all q u e s t i o n s i n b r i e f . 0 2 x 7 = 1 4
  • a
    What is data compression? Explain with the help of block diagr am
  • b
    What are some real-world applications of data compression? 1 K 2
  • c
    What is the principle behind Huffman coding?
  • d
    What is the role of the Linde-B uzo-Gray (LBG) algorithm in vector quantization?
  • e
    Differentiate between lossless and lossy compression with exam ples
  • f
    List the distortion criteria commonly used in quantization and explain their importance
  • g
    Determine the Golomb code representations of 9 and 13 when m=5
Section BAttempt any three o f t h e f o l l o w i n g : 0 7 x 3 = 2 1
  • a
    A networking company uses a compression technique to encode the message before transmitting over the network. S uppose the message contains the following characters with t heir frequency: Character Frequency
  • f
    45 Note that each character in inpu t message takes 1 byte. If the compression technique used is Huffman Coding, how many bits will be saved in the mess age?
  • b
    What is a Golomb code? How is it different from Rice code? 1 K 2
  • c
    Describe the function of the Burrows-Wheeler Transform in co mpression
  • d
    What are the key elements of the quantization problem?
  • e
    What is the role of the Linde -Buzo-Gray (LBG) algorithm in vector quantization?
Section CAttempt any one p a r t o f t h e f o l l o w i n g : 0 7 x 1 = 0 7
  • a
    Differentiate between LZ77 and LZ78 dictionary compression approaches
  • b
    Write a short note on: i. Compression Standards ii. Prediction by Partial Matching (PPM) iii. Burrows-Wheeler Transform (BWT) iv. Audio Compression v. Markov Model
  • a
    Encode the string "ABABABA" using LZW compression. Assume the initial dictionary contains all single uppercase letters (A–Z) with ASCII values (A=65, B=66, ...). Provide the output code sequence
  • b
    Write a short note on: i. Entropy ii. Compression Ratio iii. Prefix Code iv. Run-Length Encoding (RLE) v. Signal-to-Noise Ratio (SNR)
  • a
    Compare Binary coding with Huffman coding and explain their differences in performance
  • b
    Explain the LZ77 and LZ78 approaches and how they are used i n UNIX file compression
  • a
    Explain the process of scalar quantization and discuss the m odels used for it
  • b
    Describe the types of quantizers: uniform, adaptive, and non -uniform with examples
  • a
    Describe the differences between structured and tree-structu red vector quantizers
  • b
    Explain the working of the Linde-Buzo-Gray algorithm for vec tor quantization

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Data Compression — Other Year Papers

AKTU Data Compression PYQs from other sessions