You are on page 1of 2

THENI KAMMAVAR SANGAM COLLEGE OF TECHNOLOGY

KODUVILARPATTI, THENI – 625 534


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
MODEL TEST
Branch/Year/Sem : CSE/II/III Date :15.10.2019
Subject Code/Name : EC8395/Communication Engineering
Time : 3.00 Hrs Max. Marks : 100
Answer All Questions
PART – A (10×2=20) BT CO
Leve
l
1. What is ISI? And write the condition for zero ISI. 1 4
2. What is ideal nyquist channel? 1 4
3. State Shannon’s channel coding theorem for a discrete memoryless channel. 1 4
4. Explain channel capacity theorem. 1 4
5. Define information rate. 1 4
6. What is entropy? And write its properties. 1 5
7. Calculate the entropy of the source with symbol probabilities 1/2,1/4 and 1/4. 4 5
8. Define processing gain. 1 5
9. What is slow frequency hopping and fast frequency hopping? 1 5
10 List out the advantages of DSSS. 1 5
.
PART – B (5×13= 65)
11 (a) Explain adaptive equalization for data transmission. (13) 2 3
. (OR)
(b) State and explain the Shannon’s theorem on channel capacity (13) 2 4
12 (a) Compare Multiple access techniques (6) 4 5
. (i)
Explain how eye pattern is used to study the performance of a data (7) 3 4
(ii) transmission system.
(OR)
(b) Explain how cyclic codes are generated from generator polynomial (13) 4 4
and its decoding process.
(a) A DMS has the following alphabet with probability of occurrence as (13) 4 4
13 follows: Generate Huffman code. Determine code efficiency and
code variance.
Symbol So S1 S2 S3 S4 S5 S6
probabilit 0.125 0.0625 0.2 0.0625 0.12 0.125 0.125
y 5 5
(OR)
(b) Explain the operation of convolution encoder. (13) 2 4
14 (a) Explain the Shannon-Fano Algorithm with an example. (13) 2 4
(OR)
(b) Explain in detail about Multiple access techniques (13) 2 5

15 (a) Discuss in detail about FHSS with neat sketch. (13) 1 5


(OR)
(b) Explain Lempel-ziv coding with an example (13) 2 4
PART – C (1×15= 15)
16 (a) With neat sketch of transmitter and receiver of DSSS, explain its (15) 2 5
operation in detail.
(OR)
(b) Explain the viterbi algorithm for convolution codes. (15) 2 4
Bloom's Taxonomy Level Wise Mark
Distribution

31

34
108

7
L1 L2 L3 L4 L5 L6

BT Level: 1- Remembering, 2- Understanding, 3- Applying, 4- Analyzing 5- Evaluate 6-


Create

CO Wise Mark Distribution


120

100

80
Marks

60

40

20

0
CO1 CO2 CO3 CO4 CO5
Course Outcome

STAFF IN-CHARGE HOD

You might also like