NS RAJU INSTITUTE OF ENGINEERING &TECHNOLOGY::VISAKHAPATNAM
(Approved by AICTE, New Delhi, Affiliated to JNTUGV)
Dakamarri, Visakhapatnam – 531 162
CAT–1Exam
information theory and error control coding set 1
Date: BRANCH:ECE Duration: 90min.
Question paper consists of Part-A and Part-B
Answer ALL the questions from Part-A
Answer any THREE questions from Part-B
PART-A (20 Marks)
Answer ALL the TEN questions: (2x10 = 20 Marks)
1. Define Information rate?
2. What Kraft inequality equation?
3. What is the use of logarithm in measure of amount of information?
4. Draw the binary erasure channel diagram?
5. What is band width efficiency?
6. What is advantage of LEMPEL-ZIV algorithm?
7. Difference between Shannon-fano and Huffman coding?
8. What loss less channel?
9. What is the equation for channel capacity in binary symmetric channel?
10. An information contains different messages find each and every message probabilities if P1=1/4,P2=18?
PART-B (30Marks)
Answer any THREE questions: (3 x 10 = 30Marks)
1a. State Shannon’s channel coding theorem. ?
1b. Explain Cyclic Redundancy Check with suitable example?
2a. Explain Hamming codes with suitable example?
2b. Explain the binary communication channel?
3a. a DMS X with symbol xi, i=1, 2, 3, 4 list four possible binary. Check the codes are satisfy the kraft
inequality theorem
3b. explain the Mutual information and their properties?
4 a) find out code word for given sequences ABBABABBAA using Lempel-ziv-welch method?
4b) a DMS has 5 symbols X1,X2,X3,X4,X5 with probability 0.4,0.19,0.1,0.16.0.15 .caluculate
effeciency using huffman algorithm ?
5a) what are the types of error detecting techniques and explain?
5b) b) Explain the noise less, loss less, deterministic channels with neat diagram?
NS RAJU INSTITUTE OF ENGINEERING &TECHNOLOGY::VISAKHAPATNAM
(Approved by AICTE, New Delhi, Affiliated to JNTUGV)
Dakamarri, Visakhapatnam – 531 162
CAT–1Exam
information theory and error control coding set 2
Date: BRANCH: ECE Duration: 90min.
Question paper consists of Part-A and Part-B
Answer ALL the questions from Part-A
Answer any THREE questions from Part-B
PART-A (10 Marks)
Answer ALL the TEN questions: (10 x 2 = 20 Marks)
1. Define code redundancy?
2. Define code efficiency?
3. What is the use of logarithm in measure of amount of information?
4. Draw the binary symmetric channel diagram?
5. What is Entropy?
6. What is an application of LEMPEL-ZIV algorithm?
7. Difference between Shannon-fano and Huffman coding?
8. What noiseless channel?
9. What is the equation for channel capacity in binary erasure channel?
10. An information contains different messages find each and every message probabilities if P1=1/2,P2=1/6?
PART-B (30 Marks)
Answer any THREE questions: (3 x 10 = 30 Marks)
1a. State Huffman coding theorem.
1b. Explain Check Sum with suitable example
2a a DMS has 5 symbols X1,X2,X3,X4,X5 with probability 0.3,0.08,0.1,0.12,0.15,0.25 .caluculate
effeciency using Huffman algorithm.
2b. Explain the binary symmetric channel
3a. a DMS X with symbol Xi, i=1, 2, 3, 4 list four possible binary. Check the codes are satisfy the Kraft
inequality theorem
3b. explain the Entropy and their properties
4 a) find out code word for given sequences ABABBABCABABBA using Lempel-ziv-welch method
4b) a DMS has 5 symbols X1,X2,X3,X4,X5 with probability 0.4,0.19,0.1,0.16.0.15 .caluculate
effeciency using Shannon-fano algorithm.
5a) what are the types of error correction technique and explain
5b) if the data words sent bit is 11010110110000 and key words are 10011 check the error by using
cyclic redundancy check.
