0% found this document useful (0 votes)
6 views

ITC_Mid Term 2024_V Sem_CSE_BTech

This document outlines the Internal Assessment Test for the Department of Computer Science Engineering at MLSU, focusing on Information Theory and Coding. It includes various questions related to entropy, cyclic codes, Shannon's theorems, and linear block codes, with a mix of theoretical and practical problems. The test is structured into three sections, requiring students to attempt all questions in Section A, any two from Section B, and one from Section C.

Uploaded by

ajaysuyal7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

ITC_Mid Term 2024_V Sem_CSE_BTech

This document outlines the Internal Assessment Test for the Department of Computer Science Engineering at MLSU, focusing on Information Theory and Coding. It includes various questions related to entropy, cyclic codes, Shannon's theorems, and linear block codes, with a mix of theoretical and practical problems. The test is structured into three sections, requiring students to attempt all questions in Section A, any two from Section B, and one from Section C.

Uploaded by

ajaysuyal7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

I

Institute of Engineering & Technology, MLS


U, Uclaipur
Department of CS Engineering

Thirc1Year2023-24

Internal Assessment Test IAT m rovcmen


Sub ject and Code: BTS CS0 l-CT 0l Info t
Dur atio n: lHr rma tion The ory & Cod ing
Note: Max.Marks:20
1. Attempt all questions.
2. Dra w neat diagrams wherever necessary
.
. ~- - .
q!.(a) If a OMS emits two messages with Sect ion- A (Attelllpt all questions
probability_of 1/2 each. Calculate entropy.)
. 1(b) Show that the code C = {000
0, 0101, 1010, 11 I I} is linear Cyclic Code 2
/l( c) Explain channel capacity theo .
rem. 2
2
Section B (Attempt any two)
Q2
State Shannon-Hartley theorem and from
that derive Shannon's theoretical limit.
4
OR
A DMS has five symbols with probabil
ities of 0.4, 0.19, 0.16, 0.15, 0.10. Con
Code and calculate average codeword struct Huffman 4
length.
Q3 Define generator and parity check matrices of a (7, 4) linear block code.
linear block code using G-matrix. Explain Explain how to generate a
with an exainple. 4

OR
Show that for a discrete binding channel
H(x,y) = H(x I y) + H(y) 4
l-J(x,v) -- H(x) + H(y)

SectioH C (Attempt any one)


Q4 For a (6,3) Linear Block Code, the three parity ch~c
k bits c4, c5, c6 are formed from following
Vo ns : 6
C4 = d.1 E9 d3·
/ C5 = d I E9 d2 E9 d3
cG = al EB d2
Write down the generator matrix G.
Construct all possible code words.

QS 1. Consider a binary channel in figure

0.9
6
P(x 1)
Yi
x,>

P(x 1) X2 ~.,,
O.B
a) Find channel matrix of the chan
b) Find P(y 1), & P(y ) when P(x
nel
2 1) = P(x2) = 0.5
c) Find joint probabilities P(x2
,y ), & P(x1,Y2)
1
when P(x 1) = P(x 1 0.5
-

You might also like