B.TechSemester 72022-23Information Theory CodingKEC075

Information Theory Coding (KEC075) - AKTU Question Paper 2022-23

B.Tech · Semester 7 · Free PDF Download

This is the official AKTU Information Theory Coding Previous Year Question Paper for B.Tech Semester 7, academic session 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:B.Tech
Semester:Semester 7
Session:2022-23
University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Information Theory Coding (KEC075) — complete question paper

Section AAttempt all questions in brief. 2 x 10 = 20
  • a
    What is conditional entropy?
  • b
    “Sun rises in the south”. This statement contain what amount of information
  • c
    What is Kraft’s Inequality?
  • d
    What is optimal solution for a source coding?
  • e
    On which parameters does channel capacity depend?
  • f
    What is Noisy Channel? Determine its matrix representation
  • g
    What is Hamming Distance? Give Example
  • h
    What are prefix code? State (i) What are parity bits and its importance? (j) What does k determine in convolution coding?
Section BAttempt any three of the following: 10 x 1 = 10
  • a
    A discrete source emits one of five symbols once every seconds with probabilities 1/2, 1/4, 1/8, 1/16 and 1/16. Find the source entropy and information rate
  • b
    A Memory less source emits six messages with probabilities X
                           {0.3, 0.2, 0.2, 0.1, 0.1,0.05,0.05}
    Find the Shannon - Fano code and determine its efficiency
  • c
    Give the relation between channel capacity C, bandwidth W and s ignal to noise ratio S/N of a AWGN channel. Explain the trade-off between them
  • d
    A generator matrix for a (6, 3) block code is given below (i) List all the code vectors (ii) How may errors can be corrected and detected
  • e
    Explain the working of (2,1,3) convolutional encoder using tran sform domain approach
Section CAttempt any one part of the following: 10 x 1 = 10
  • a
    Show that I(X;Y):H(X)+H(Y)-H(X,Y). List out the properties of M utual information prove any two properties?
  • b
    Explain what is log sum inequality and list it applications?
  • a
    What is meant by stop-and-wait ARQ? Explain
  • b
    Construct the Huffman code with minimum code variance for the f ollowing
    probabilities and also determine the code variance and code efficiency:
    {0.25, 0.25. 0.125, 0.125, 0.125, 0.0625, 0.0625}
  • a
    A BSC has the error probability p = 0.2 and the input to the ch annel consists of 4 equiprobable messages xl = 000; x2 = 001; x3 = 011 ; x4 = 111. Calculate i) p(0) and p(1) at the input ii) Efficiency of the code iii) Channel capacity
  • b
    Two binary symmetric channel with error probability 0.1, are ca scaded as shown below and P (0) = 0.25.Calculate I (X,Y)and I (X,Z)
  • a
    The Generator matrix(G) for a (7, 4) block code is given below (i) Find the parity check matrix G (ii) Find code vectors
  • b
    Draw and explain the block diagram of ARQ system in detail
  • a
    Consider the convolutional encoder shown in Figure 1. The messa ge bits are shifted into the encoder two bits at a time. Assume the initial content of the registers to be zero and find the code block for the input message block 11010
  • b
    Design a convolutional coder of constraint length 6 and rate ef ficiency ½.Draw its tree diagram and trellis diagram

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.

Repeated Questions — KEC075

Questions that appeared in more than one session, found by comparing 2 years of Information Theory Coding papers (2022-23, 2024-25)

2x

Explain what is log sum inequality and list it applications?

Appeared in: 2022-23 · 2024-25

Information Theory Coding — Other Year Papers

AKTU Information Theory Coding PYQs from other sessions

Syllabus & More PYQs

Paper solve karne se pehle unit-wise syllabus dekh lo