Sr No Unit I Question Unit I Answer Option A Unit I Answer Option B Unit I Answer Option C Unit I Answer Option D

1 Stochastic processes are Strict sense stationary pro Wide sense stationary procAll of the mentioned None of the mentioned
2 Which gives the measure oMean Variance PDF Std variance
3 Random Processes and NoA B C D
4 Random process is also cal 1 0 May be Can't say
5 In poisson distribution mea Greater than Lesser than Equal to Does not depend on
6 Two functions are called asOne Zero Infinity None of the mentioned
7 Random variables give rel a) Two random events b) Probability of occurence c) Random event and a read) Random event and its pro
8 Which reduces the dynamicNon uniform quantizer Uniform quantizer Adaptive quantizer None of the mentioned
9 In random
A Randomprocess
Processiswe ha sample
defined function
as ergodic if ensemble of sample functi sample space & sample poisample function & ensemble
10 All types of ensemble ave All types of ensemble aver All types of ensemble aver None of above
11 Cross correlation function Information about the structInformation about the behaiThe measure of dissimilaritThe measure of similaritiea
12 The
Power type
of of distortion
W.S.S. which
process a) Slope
can overload
be obtained by distortionGranular noise
evaluating Slope overload distortion d) None of the mentioned
13 a) Autocorrelation function b) E [ X2 (t)] c) a and b both are true d) None of the above
14 (iv) Autocovariances that are (ii)zero
and except
(iv) onlyat lag zero (i), (ii), and (iii) only (i) and (iii) only (i), (ii), (iii), and (iv)
15 Auto Correlation is also k Cross Correlation Self Correlation Both above mentioned None Mentioned
16 Random processes & NoiseA B C D
17 Q1] Noise is ________ A] Always unwanted signalB] Always wanted signal C] Mostly unwanted signal bu D] None of the above
18 Gaussian process is a a)Wide sense stationary pr b) Strict sense stationary c) All of the mentioned d) None of the mentioned
19 If R(τ) is the auto-correlat 𝑅(𝜏)=𝑅(−𝜏) |𝑅(𝜏)|≤𝑅(0) 𝑅(𝜏)=−𝑅(−𝜏) The mean square value of t
20 The channel may be affect a) Thermal noise b) Interference from other sc) Thermal noise & Interfer d) None of the mentioned
21 A random process is calledIts a statistics vary with shift Its statistics does not vary wIts autocorrelation vary withIts autocorrelation does not
22 Random process & noise A B C D
23 Consider the random proces 0 1 2 4
24 Stochastic processes are Strict sense stationary pro Wide sense stationary procAll of the mentioned None of the mentioned
25 A random
(iv) X(t) hasprocess is called
a periodic Its
a statistics vary with shift Its statistics does not vary wIts autocorrelation vary withIts autocorrelation does not
component.
26 Which of the following is true? a) 1, 2, and 4 b) 2, 3, and 4 c) 2 and 3 d) only 3
27 The auto correlation function average value mean square value PSD None of above
28 Random process & noise A B C D
29 If the mean is constant andWide sense stationary Second order stationary Weakly stationary All of the above
30 Random variables give rel Two random events Probability of occurrence Random event and a real Random event and its proba
31 Which has the same powerWhite noise Brown noise White & Brown noise None of the mentioned
32 The auto correlation Rxx(t1 1 0A x A 0.5 (A x A)
33 A random process is defined 0 1/2 1/4 1
34 When can a random process Only when time averages aOnly when time averages aOnly when time averages anone of the above
35 Stochastic Processes are Function of time Random in nature Not a function of time Periodic in nature
36 Random Processes and noGiven a random process X(t)=k A WSS random process X(t) Given
i a random process X(t)=n
Given a random process X(t)=n
37 Yes Yes Yes Yes Yrs
38 Noise has Infinite energy Infinite power Infinite energy & power None of the above
39 1. Which method is much bet Vector quantization Scalar quantization Vector & Scalar quantizatioNone of the mentioned
40 A Wide Sense Stationary r Mean constant Covariance constant Variance constant None of these
41 Gaussian process is a Wide sense stationary procStrict sense stationary procStrict sense and wide sensErgodic
42 Stochastic process are Random in nature Are function of time Random in nature and are a None of the mentioned
43 1)Stochastic process are a) Random in nature b) Are function of time c) Random in nature and are d) None of the mentioned
44 In Poisson distribution me Greater than Lesser than Equal to Does not depend on
45 Random variables give rel Two random events Probability of occurence o Random event and a real Random event and its proba
46 Which reduces the dynamicNon uniform quantizer Uniform quantizer Adaptive quantizer None of the mentioned
47 Binomial distribution deals Continuous random variablDiscrete random variable Continuous and discrete raNone of above
48 Autocorrelation is a functi Two same signals Two different signal One signal with its delayedNone of the mentioned
49 Which reduces the dynamicNon uniform quantizer Uniform quantizer Adaptive quantizer None of the mentioned
50 The type of distortion whichSlope overload distortion Granular noise Slope overload distortion &None of the mentioned
51 Stochastic process are Random in nature Are function of time Random in nature and are a None of the mentioned
52 The value of the probabilitya) Positive function b) Negative function c) Zero d) One
53 The value of the probabilityPositive function Negative function Zero One
54 A random process X(t) whos Strict-Sense Stationary ra Wide Sense Stationary ranErgodic random process Gaussian random process
55 The average power P of whiZero One Infinite Can not be determined
56 The autocorrela.tion function Origin Infinity Origin and Infinity None of the Above
57 Random variables give rela Two random events Probability of occurence o Random event and its probab Random event and a real
58 Q. A _______ random process
a) Stationary b) Wide Sense Stationary
For a periodic function, the spectral density and auto correlation functions forms ___ ___
59 Fourier transform pair Laplace transform pair Z transform pair Hilbert transform pair
60 A continuous random variable Limit Range Both of A & B None of these
61 A random process is given 0.5A²cos(2ω)
by 0.5A²sin(2ω) 0.5A²cos(ωt) 0.5A²sin(ωt)
62 In a communication
(Stationary system,
in Wide Sense) Stationary Ergodic in Strict Sense). Gaussian
are also absolutely SSS (Stationary Poisson
63 Which of them are correct?A is true & B is false A is false & B is true Both A & B are true Both A & B are false
64 Which gives the measure oMean Variance
The statistical characterization of the process is ------------------- invariant. Standard Deviation pdf
65 frequency time pole one pole zero
66 A video created isfrom
Autocorrelation a presJPEG
a function which matches Windows Media Video Fire player Movie maker
67 a) Two same signals b) Two different signal c) One signal with its delayd) None of the mentioned
68 Statistical properties of st Change with time Do not change with time Depends on other parametNone of the above
69 A ______ random process Stationary
has Wide sense stationary Ergodic Non-Stationary
70 Stochastic processes are....Strict sense stationary pro Wide sense stationary procAll of the mentioned None of the mentioned
71 Randomness in voltage thatShot noise Additive noise Thermal Noise Fading noise
72 A random process is calledIts a statistics does not vary wIts statistics does not vary wIts autocorrelation vary withIts autocorrelation does not
73 Random process is a random variable that iscan be viewed as the outcom Both (A) and (B) None
74 For a three stage cascade a 12 24 13.55 8
75 Which
III. Themathematical notation
a. x(t) =ofx(t
quadrature components n(t)+T0)
have the sameb.variance
x(n) = x(n+ N) of n(t). c. x(t) = e-αt
as that d. None of the above
76 a.Option I is correct b.Option I and II are correcc.Option I and III are correcd.All the above I,II and III
77 . A receiver is operated at 1.8 µV 8.4 µV 4.3 µV 12.6 µV
78 A stationary stochastic pro Finite energy signal Infinite zero signal Zero energy signal None of the mentioned
79 For strictly stationary rand Ensemble averages do not statistical
v characteristics v PDFs obtained at different iStatistical characteristics
80 Which among the followinga) The results are always r b) Interviewers can choosec) Informants can refuse to d) We can calculate the acc
ANSWER UNIT I
Strict sense stationary process
Variance
Random Processes and Noise
1
Does not depend on
B----Zero
Answer: C
Adaptive quantizer
D
All types of ensemble average are interchangeable
The measure of similarities between two signal
Slope overload distortion & Granular noise
c) a and b both are true
Option A: (ii) and (iv) only
Self Correlation
UNIT I
C] Mostly unwanted signal but in some application like oscillator it is wanted signal
C) All of the mentioned
𝑅(𝜏)=−𝑅(−𝜏)
C
Its statistics vary with shift in time origin
Random process
2
Wide sense stationary process
A
c)
mean square value
1
All of the above
Random event and a real number
A
(A x A)
1/2
b
Option A & B
Random Processes and noise
Yrs
Infinite energy
A) Vector quantization
A
C
Random in nature and are a function of time
c) Random in nature and are a function of time
C
C
C
Discrete random variable
C
Adaptive quantizer
C) Slope overload distortion & Granular noise
Random in nature and are a function of time
a) Positive function
Positive function
Wide Sense Stationary random process
Infinite
Origin
D
Ans: Stationary
Fourier transform pair
Range
A
B
A) A is true & B is false
B
time
Movie maker
c) One signal with its delayed version
Do not change with time
Option A
B.Wide sense stationary process
Thermal noise
A
C
C
 Option A:a. x(t) = x(t +T0)
d.All the above I,II and III are correct
A
Infinite zero signal
Ensemble averages do not vary with time
d) We can calculate the accuracy of the results.
Sr No Unit II Question
The data Unit II AnswerofOption
rate of QPSK is ___________ BPSK.A Unit II Answer Option B Unit II Answer Option C Unit II Answer Option D
1 3 times 4 times 2 times same
2 Which of the following dig QAM BPSK BFSK QPSK
3 Digital Modulation-I A B C D
4 Bandwidth requirement of same twice half can't say
5 The spectrum of BFSK mayTwo ASK spectra Two PSK spectra Two FSK spectra None of the above
6 For a noise to be white GauLow pass filter Base band filter Matched filter Bessel filter
7 Which has same probabilitya) ASK and FSK b) ASK and PSK c) PSK and FSK d) None of the mentioned
8 Which has same probabilityBPSK and QPSK BPSK and ASK BPSK and PAM BPSK and QAM
9 In Binary Phase
Orthogonality Shiftcodes
of two KeyinΠ/2
means Π 2Π 0
10 The integrated product of t The integrated product of t The integrated product of None of the above
11 The modulation techniquesPCM u DM ADM All the above
12 The detection method where a) Coherent detection b) Non coherent detection c) Coherent detection & Nod) None of the mentioned
13 What is advantage of QPS a) Data rate is higher. b) Bandwidth is smaller. c) Probablilty of error is higd) Data rate is smaller.
14 The bit rate of digital com 8.5 M bits/sec 64 M bits/sec 32 M bits/sec 17 M bits/sec
15 The process of suppressingSingle Sideband SuppresseDouble Sideband Suppresse Amplitude Modulation Digital Modulation
16 Digital Modulation-I A B C D
17 Q] In digital communication,A] 0.1 B] 0.01 C] 10 D] 0.0001
18 Which of the following has ASK FSK PSK QAM
19 The receiver is called an ---Matched Filter Optimum Receiver Coherent Reciever Non Coherent Receiver
20 In Binary Phase Shift Keyina) Π/2 b) Π c) 2Π d) 0
21 The modulation scheme com 4-QAM 16-PSK Walsh-Hadamard orthogona Gaussian Minimum Shift K
22 Digital modulation A B C D
23 QPSK has ________ the ban Twice Same Half Four times
24 A carrier
The is modulated
probability of errorby
of aBPSK
DPSK is ______________ than QPSK that of BPSK. QAM FSK
25 Higher Lower Same Not Predictable
26 DS/BPSK includes a) Despreading b) Demodulation c) Despreading & Demodulad) None of the mentioned
27 A matched filter is a ___ fi linear, minimum linear, maximum Non linear, maximum Non linear, minimum
28 Digital Modulation A B C D
29 The number of message sym 4 2 1 8
30 QPSK system uses a phaseΠ Π/2 Π/4 2Π
31 Coherent detection is…. PLL is used at receiver local carrier generated at t carrier transmitted at the r local carrier generated at t
32 The FSK signal which has aDifferential PSK Continuous PSK Differential & Continuous None
33 Which gives maximum probab
ASK BFSK BPSK DBPSK
34 For a noise to be white GauLow Pass filter Band pass filter Matched Filter Bessel filter
35 Bandwidth of BFSK is fb/2 fb 2fb 4fb
36 Digital Modulation-I Bandwidths of BPSK and QPSK Bit rate of NRZ data streamBit rate of NRZ data streamThe maximum signal to noise r
37 Yes Yes Yed Yes Yes
38 Which FSK has no phase diContinuous FSK Discrete FSK Uniform FSK None of the mentioned
39 Which FSK has no phase diContinuous FSK Discrete FSK Uniform FSK None of the mentioned
40 The bandwidth of BPSK in 2fb te 3fb 4fb fb
41 The FSK signal which has aDPSK BPSK BPSK and DPSK None
42 The signals which are obtaPAM signal PCM signal FM signal Sampling and quantization
43 The bandwidth of BFSK is ______________
a) Lower than BPSK.
b) Same c) Higher d) Not predictable
44 Which FSK has no phase diContinuous FSK Discrete FSK Uniform FSK None of the mentioned
45 In Binary Phase Shift Keyi Π/2 Π 2Π 0
46 For generation of FSK the dRZ pattern NRZ pattern Split-phase Manchester None
47 BPSK system modulates at1t bit per symbol 2 bit per symbol 4 bit per symbol None of above.
48 Every frequency has ____ o One Two Four Six
49 The characteristics of com Continuous in nature Logarithmic in nature Linear in nature Discrete in nature
50 Which FSK has no phase diContinuous FSK Discrete FSK Uniform FSK None of the mentioned
51 The bit rate of a digital 7.5Mbps 60 Mbps 15 Mbps 30 Mbps
52 In coherent
The detectiondetection
methodof siga. carrier’s
where Local carrier is is
phase generate b. Carrier of
given importance is frequency
called as and c. The carrier is in synchr d. All of the above
53 Coherent detection Non coherent detection Coherent detection & Non cNone of the mentioned
54 How the data rate of QPSKdata rate of QPSK is twice data rate of QPSK is four data rate of QPSK is thric data rate of QPSK is same
55 Bandwidth
The of BPSK
performance is__ is
of BPSK 2 fb
best is term of BER because4 fb _______ fb 1/2 fb
56 Symbol offset interference Existence of cross rail inte No multipath delay Doppler spread
57 The spectrum of BFSK mayTwo ASK spectra Two FSK spectra Two PSK spectra None of the above
58 Q. Bandwidth
QPSK of QPSKscheme
is a modulation is_ a) 2fb b) fb of
where each symbol consists C) 4fb d) 3fb
59 M number of bits, dependin4 bits 2 bits 1 bit
60 QPSK is a modulation where 4 bits 2 bits 8 bits 1 bit
61 Suppose that binary data is4.75 mV 3.36 mV 2.38 mV 1.38 mV
62 In BPSK, the ________ of co Amplitude Phase Frequency Angle
63 Symbol duration for QPSK Tb 2Tb Tb/2 4Tb
64 A carrier is modulated by aBPSK QPSK QAM MSK
65 In BPSK, two balanced mod WH and WL WH and one with carrier WWL and WH WX and one with carrier W
66 The probability of error o Higher Lower Same Not predictable
67 a. Π/2 b. Π c. 2Π d. 0
68 BPSK signal can be demodu band pass filter high pass filter low pass filters None
69 Bandwidth
QPSK of QPSK is____2fb
is a modulation scheme where each symbol consists 4fb of.... fb 0.5fb
70 4 bits 2 bits 1 bit M number of bits, dependin
71 Error Probability of matchedShape of the signal PSD of the signal Energy of the signal CDF of the signal
72 The maximum bandwidth isASK BPSK FSK QPSK
73 Maximum signal-to-noise rat E/(2Nₒ) 2E/(Nₒ) E/(Nₒ) 3E/(Nₒ)
74 For generation of FSK the dRZ pattern NRZ pattern Split-phase Manchester None
75 Binary Frequency Shift Keying QAM (BFSK) APSK BPSK BFSK
76 Carrier recovery circuit is ua.Coherent detector b.Non coherent detector c.Bit synchronizer d.Integrate and dump circui
77 Average energy per bit is gaverage energy symbol/logaverage energy symbol * l log2 M/ Average energy s none of the mentioned
78 The data rate of QPSK is Thrice Four times Twice Same
79 a. estimate the frequency oIn parameter estimation pr To estimate the distance ofAll of the above
80 If the modulating frequenc 100 KHz 230.2 KHz 199.8 KHz 123.6 KHz
ANSWER UNIT II
2 times
BFSK
Digital Modulation-I
half
Two ASK spectra
C---Matched filter
Answer: C
BPSK and PAM
B
The integrated product of two different code words is zero
All the above
a) Coherent detection
a) Data rate is higher.
Option D:17 M bits/sec
Single Sideband Suppressed carrier
UNIT II
B] 0.01
A)ASK
Optimum Receiver
B
Gaussian Minimum Shift Keying (GMSK)
Digital modulation-1
Twice
QPSK
A - Higer
c)
linear, maximum
2
4
Π/2
D
Continuous PSK
ASK
c
Option D
Digital Modulation-I
Yes
Continuous FSK
a) Continuous FSK
A
BPSK
PCM signal
c) Higher
A
B
B
1 bit per symbol.
B
Continuous in nature
A) Continuous FSK
15 Mbps
d. All of the above
Coherent detection
data rate of QPSK is twice of BPSK
2 fb
Symbol offset interference does not exist
A
Ans: fb
2 bits
2 bits
A
B
B. 2Tb
B
WH and one with carrier WL
Higher
b. Π
low pass filters
Option B
B.2 bits
Energy of the signal
C
B
B
Option D:BFSK
a.Coherent detector
A
Twice
All of the above
199.8 KHz
Sr. No. Unit III Question Unit III Answer Option A Unit III Answer Option B Unit III Answer Option C Unit III Answer Option D
1 Minimum shift keying is simiContinuous phase frequency Binary phase shift keying Binary frequency shift keyi QPSK
2 Common data rates of IE 54Mbps 200Mbps 18 Mbps 50Mbps
3 Digital Modulation-II A B C D
4 Probability of error in
4. 4G mobile communicationQA same more less can't say
5 1,2 and 3 are correct 2 and 3 are correct 1, 2 and 4 are correct All the four correct
6 In MSK, the difference bet Same as the bit rate Half of the bit rate Twice of the bit rate Four time the bit rate
7 QAM uses ______ as the a) In phase b) Quadrature c) In phase & Quadrature d) None of the mentioned
8 FSK reception uses Correlation receiver PLL Correlation receiver & PLL None of the mentioned
9 OFDMA
The filterstands for pulse shaping
used for omnidirectional
is frequency dorthogonal frequency dupleorthogonal frequency divideorthogonal frequency divisi
10 Raised – cosine filter Sinc shaped filter Gaussian filter All of the above
11 The coherent modulation t PSK FSK ASK All the above
12 Advantages of digital comma) Easy multiplexing b) Easb) Easy processing c) Reliable d) All of the mentioned
13 OFDM is advantageous ov a) Guard band is not requirb) Spectral Efficiency is higc) a and b both are true. d) None of the above.
14 In QAM, both ________ of farequency and amplitude phase and frequency amplitude and phase none of the above
15 4-ary (or Quaternary PSK) 0,90,180,270 90,180,270,360 90,-90,180,-180 None Above
16 Digital Modulation - II A B C D
17 Q] In 256-QAM, total numbe A] 256, 8 B] 8, 256 C] 8, 8 D] 256, 256
18 Arrange in the increasing oQPSK MSK FSK ASK
19 Eye pattern is used to analISI Bandwidth Intermodulation distortion Interchannel Interference
20 Which has same probabilitya) BPSK and QPSK b) BPSK and ASK c) BPSK and PAM d) BPSK and QAM
21 When we divide band of Ortnoise collision interference signals absence
22 Digital modulation-2 A
3. wide band digital communication B C D
23 4. 4G mobile communication 1,2 and 3 are correct 2 and 3 are correct 1, 2 and 4 are correct All the four correct
24 In Time
3. MSK, synchronization
the difference bet Same as the bit rate
problems Half of the bit rate Four time the bit rate Twice of the bit rate
25 4. Low efficiency due to guard 1,2 intervals
and 3 are correct 2 and 3 are correct 1, 2 and 4 are correct All the four correct
26 8.In On- Off keying, the cara) No carrier b) Half the carrier amplitud c) Amplitude of modulating d) None of the above
27 MSK stands for ________ Maximum shift keying Minimum shift keying Minimum space keying Maximum space keying
28 Digital Modulation II A B C D
29 Which modulation requires BPSK BFSK QPSK M-ary PSK
30 In MSK, the difference bet Same as the bit rate Half of the bit rate Twice of the bit rate Four time the bit rate
31 OFDM faces Low efficiencyguard intervals time synchronization frequency synchronization sensitivity
32 The name minimum phase Frequency
s separation Amplitude separation Phase change Amplitude deviation
33 Minimum shift keying is simicontinuous phase frequency binary phase shift keying binary frequency shift keyi qpsk
34 For non coherent receptionDifferential encoding Decoding Differential encoding & De None of the mentioned
35 What is M value in case o 2 4 8 16
36 Digital Modulation-II Calculate Bandwidth of a 16-QAM
Bandwidths of QPSK and BPSK Bandwidths of BPSK and BFSK Bandwidths of QPSK and BFSK
37 Yes Yes Yes Yes Yes
38 QAM uses ______ as the dIn phase Quadrature In phase & Quadrature None of the above
39 What are the primary featurLower clock speed Lower transmitting power Higher clock speed None of these
40 MSK stands for Mean Shift Keying Minimum Shift Keying Many Shift Keying Max Shift Keying
41 The coherent modulation t PSK FSK ASK All of the Above
42 Matched filter is a _____ t Modulation Demodulation Modulation & Demodulatio None of the mentioned
43 A 1 Mbps BPSK receiver dete a)5×〖10〗^(-13) J b) 10×〖10〗^(-13) J c) 5×〖10〗^(-10) J d) 10×〖10〗^(-10) J
44 In the digital communicatio Orthogonal Non orthogonal Orthogonal & Non orthogonNone of the mentioned
45 The
If theguard
baud interval is prov
rate is 400 for aTo eliminate
QPSK the
signal, need
the rateofis pulTo eliminate ISI High symbol rate Both a) and b)
46 200 400 800 1600
47 Common data rates of IEE 18 Mbps 200 Mbps 50 Mbps 54 Mbps
48 Orthogonal Frequency DivisTime-Varying channel Inter- Symbol Interference multi-path propagation Multi-user interference
49 DPCM is a technique To convert analog signal intWhere difference between sWhere digital codes are theAll of the above
50 The modulation techniquesQAM GMSK QPSK GFSK
51 the phenomenon of overlappi scattering dispersion attenuation intersymbol interference
52 In MSK,
error the difference
performance with bet a) Same
multiple phaseassignalling.
the bit rate b) Half of the bit rate c) Twice of the bit rate d) Four time the bit rate
53 Degraded, improved Improved, degraded Improved, improved Degraded, degraded
54 What will be obtained innerzero In phase Cannot be determined Quadrature
55 The probability
QAM uses ______ of error fo dimensions.
as the Increases Decreases Remains constant None of the above
56 a) In phase b) Quadrature c) In phase & Quadrature d) None of the mentioned
57 When we divide the band ofNoise Collision signals absence interference
58 Q. QAM
Which ofisthe
combination of a) ASK scheme
following modulation & FSK is the most b) FSK &
energy PSK under the c)
efficient ASKBER
same & PSK
requirement d) None of above
59 8-PSK 16-PSK 8-FSK 16-FSK
60 What type of reception tec Coherent Noncoherent Both Synchronous
61 When a signal with energy √EE E E² E³
62 In Avoids
3. M-ary FSK,
ISI as M increasIncreases Decreases Does not get effected Cannot be determined
63 4. Multiple users at same frequency
1,2 and 3 are correct b. 2 and 3 are correct c. 1, 2 and 4 are correct d. All the four correct
64 In QAM, both ________ of farequency and amplitude phase and frequency amplitude and phase none of the above
65 In MFSK, the M transmittedless energy and equal duraequal energy and large dur energy and less duration equal energy and equal dur
66 The guard interval is prov To eliminate the need of pulTo eliminate ISI High symbol rate Both a) and b)
67 Which property of OFDM sys Originality Orthogonality octogonality Orthodoxy
68 The modulation techniquesQAM GFSK QPSK GMSK
69 QAM is a combination of ASK & FSK ASK & PSK FSK & PSK None of the above
70 The method in which the tail Intersymbol interference Interbit interference Interchannel interference None of the mentioned
71 What is OFDM stands for Optical frequency division m Orthogonal Frequency DivisOptical Frequency Division Orthogonal Frequency Divis
72 The constellation diagram 4 8 16 2
73 M-ary signalling produces Degraded, improved Improved, degraded Improved, improved Degraded, degraded
74 In a system using in FSK, t45 µs 200 µs 50 µs 250 µs
75 OFDM is similar to TDM FSD BPS FDM
76 Quadrature Amplitude modul Amplitude shift keying Amplitude and phase shift Frequency and phase shift Frequency shift keying
77 FSK reception is.............. Phase Coherent Phase non coherent Phase Coherent & non cohNone of the mentioned
78 In M-ary FSK, as M increasIncreases Decreases Does not get effected Cannot be determined
79 Power efficiency of QAM issuperior to M-ary PSK inferior to M-ary PSK superior to QPSK inferior to QPSK
80 In Delta modulation, One bit per sample is trans All the coded bits used for The step size is fixed Both a) and c) are correct
ANSWER UNIT III
Continuous phase frequency shift keying
18Mbps
Digital Modulation-II
same
All the four correct
B--Half of the bit rate
Answer: C
Correlation receiver & PLL
D
All of the above
All the above
All of the mentioned
c) a and b both are true.
Option C:amplitude and phase
0,90,180,270
UNIT III
A] 256, 8
A,B,D,C
ISI
C
interference
Digital modulation-2
All the four correct
Half of the bit rate
C - 1, 2 and 4 are correct
a)
Minimum shift keying
3
BFSK
Half of the bit rate
A
Frequency separation
continuous phase frequency shift keying
c
Option B
Digital Modulation-II
Yes
In phase & Quadrature
d) None of these
B
d
Demodulation
a)5×〖10〗^(-13) J
A
D
C
18 Mbps
B
All of the above
A) QAM
intersymbol interference
b) Half of the bit rate
Improved, degraded
zero
Decreases
c) In phase & Quadrature
D
Ans: ASK & PSK
16-FSK
Noncoherent
A
B
d. All the four correct
C
equal energy and equal duration
Both a) and b)
B Orthogonality
QAM
Option C
A.Intersymbol interference
Orthogonal Frequency Division Multiplexing
C
B
B
Option D:FDM
Amplitude and phase shift keying
C
Decreases
superior to M-ary PSK
Both a) and c) are correct
Sr. NoUnit IV Question Unit IV Answer Option A Unit IV Answer Option B Unit IV Answer Option C Unit IV Answer Option D
1 Which of the following is n Nearly equal number of 0s Low correlation between shNon deterministic Low cross-correlation bet
2 If intial pulse of 0001 is f 17 16 15 14
3 Spread spectrum modulati A B C D
4 Pseudorandom sequence ipurely random periodic & random Periodic none of these
5 DSSS system spreads the b Adding Subtracting Multiplying Dividing
6 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
7 The properties used for p a) Balance b) Run c) Correlation d) All of the mentioned
8 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
9 In CDMA, the system uses FDD TDD Both 1 & 2 None of the above
10 DSSS system spreads the b Adding Subtracting Multiplying Dividing
11 Which of the following is n Low cross correlation bet Nearly equal number of 0s Low correlation between shNon deterministic
12 The sequences produced by Number of stages b) Feedback tap connectionc) Initial conditions d) All of the mentioned
13 The extent to which effect a) Jamming Margin b) Processing Gain c) Single tone interference d) Error Probability
14 The processing gain is given the minimum bandwidth of th data to data rate bandwidth to signal noise data rate to minimum band
15 In direct sequence process De-spreading De-modulation Both A&B None mentioned
16 Spread Spectrum Modulati A B C D
17 Q] Which of the following s A] It requires more bandwidB] It requires less bandwidtC] It requires less bandwidtD] It requires high bandwidt
18 In the Frequency Hopping S Short Long Zero Infinity
19 If feedback shift register l 3 4 15 16
20 Which is more simpler to i a) Direct sequence spread b) Frequency hopping spr c) Time hopping spread sp d) None of the mentioned
21 The bandwidth of the channHopping bandwidth Total hopping bandwidth Instantaneous bandwidth 3 dB bandwidth
22 Spread spectrum modulati A B C D
23 A PN sequence is generated 15 12 16 10
24 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
25 Spread spectrum has immun Noise Multi-Path Distortion Noise & Multipath Distortio None of the mentioned
26 Which modulation schemea) i BPSK b) QPSK c) BPSK & QPSK d) None of the mentioned
27 In DSSS-BPSK system, the s 32000 32768 32767 32769
28 Spread spectrum modulati A B C D
29 DSSS is Digital signal spread spect Direct sequence spread spDigital sequence spread s Direct signal spread spect
30 Which of the following is n Interference rejection capabi Multipath fading Frequency planning eliminaMultiple user, multiple acce
31 PN sequence is used in CDMA DSSS Both DSSS and CDMA BPSK
32 Chip is defined as Shortest uninterrupted wavLargest uninterrupted wav Shortest diversion None of the mentioned
33 The frequency hopping sy FSK BPSK MFSK MPSK
34 If the rate of change of the Fast frequency hopping sy Slow frequency hopping syTime division frequency hoCode division multiple acc
35 What is MLS in PN sequenMaximum Length SequencMinimum Length SequenceMaximum Likelihood SequeMinimum Likelihood Seque
36 spread spectrum modulatioFor a DSSS system, Find the sequence spread Spectrum A sPN sequence is generated A PN
us sequence is generated usi
37 Yes Yes Yed Yes Yes
38 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
39 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
40 A N bit PN sequence generat 2N N-1 N+1 N
41 In direct sequence processDe-spreading Demodulation Despreading & DemodulatiNone of the mentioned
42 Frequency hopping involves Signal Frequency Phase Amplitude
43 Which of the following is n a) Nearly equal number of b) Low correlation betweenc) Non deterministic d)None
44 Frequency hopping involves Signal Frequency Phase Amplitude
45 Which of the following is n Interference rejection capabi Multipath fading Frequency planning eliminaMultiple user, multiple acce
46 In DSSS the signal is recoLow pass filter High pass filter Band pass filter Band stop filter
47 Why spread spectrum techniqu Large transmissions BW Small transmission BW Fixed transmission BW Fixed null BW
48 For any cyclic shift, the aut 1/p -1/p -p p
49 In DSSS the signal is recoLow pass filter 2. High pass filter 3. Band pass filter 4. Band stop filter
50 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
51 DSSS system spreads the b adding subtracting multiplying dividing
52 The minimum spacing betwe a) Minimum number of chipb) Maximum number of chipc) Chip rate d) None of the mentioned
53 DS/BPSK includes Despreading Demodulation Despreading & DemodulatiNone of the mentioned
54 For FH systems, the process 3 dB bandwidth and bit rat Total hopping bandwidth a Instantaneous bandwidth aHopping bandwidth and hop
55 Properties of maximal-lengBalance property Run property Correlation property All of the above
56 a) Frequency follower jam b) Repeat back jammers c) Frequency follower & R d) None of the mentioned
57 The technique that uses M spreading
d FHSS Multiplexing DSSS
58 Q. Application
Frequency of spread
hopping spreads a) Police Radar
spectrum uses modulation b) Telecommunication
name as c) GPS d) All of the above.
59    FSK BPSK MFSK MPSK
60 Calculate length of maximu 5 25 10 31
61 Suppose a maximum lengthThe se total number of bit 1 is state 00000 is the prohibited
There are total 16 runs. There are 2 runs of length
62 DSSS system spreads the b Adding Subtracting Multiplying Dividing
63 Chip rate is used in Frequency hopping spreadDirect sequence spread spTime hopping spread syst All of the above
64 DSSSS stand for Direct Sequence Spread SpDirect Sequence Signal SyDirection Sequence Signal either (a) or (b)
65 In CDMA using DSSS, eachtwo usPN code unique PN code similar PN code different PN code
66 Why spread spectrum techniq Large transmission bandwiSmall transmission bandwi Fixed transmission bandwi Fixed null bandwidth
67 a) Hopping bandwidth and b) Instantaneous bandwidthc) 3 dB bandwidth and bit rd) Total hopping bandwidt
68 2G CDMA standard – cdma8 users 16 users 64 users 116 users
69 Application of spread spectPolice Radar GPS Telecommunication All of the above
70 Which of the following is n Nearly equal number of 0s Low correlation between shNon deterministic Low cross-correlation bet
71 Processing gain in DSSS isTb/Tc 2Tb Tc/Tb 2Tc
72 Chip rate for fast FHSS is e   Symbol rate Hop rate Neither Symbol rate not HoNone of the above
73 If there
In whichare m shift regist
modulation m the spreading of spectrum
schemes, (2ᵐ)-1
occurs? 2ᵐ/2 2ᵐ
74 Frequency modulation Amplitude modulation Frequency & Amplitude mod None of the mentioned
75 Differential entropy and muCDMA TDMA FDMA SDMA
76 Balance, run and correlationp-n sequence generator Maximum length p-n sequeDirect sequence spread spFrequency hop spread spec
77 Why spread spectrum techniq Large transmission bandwidSmall transmission bandwidFixed transmission bandwidFixed null bandwidth
78 Which is better for avoidin Direct sequence In M-ary FFrequency hopping spreadTime hopping spread spec None of the mentioned
79 length of PN sequence is g2N (2N-1) (2^N)-1 2N+1
80 BPSK system modulates at1t bit/ symbol 2 bit/ symbol 4 bit/ symbol None of the above
ANSWER UNIT IV
Non deterministic
15
UNIT IV
periodic & random
Multiplying
A-----Large transmission bandwidth
Answer: d
Large transmission bandwidth
C
Multiplying
Non deterministic
d) All of the mentioned
b) Processing Gain
Option A:the minimum bandwidth of the data to data rate.
Both A&B
IV
A] It requires more bandwidth, and transmission of data is at low power level
A) Short
15
A
Instantaneous bandwidth
Spread spectrum modulation
15
Large transmission bandwidth
C - Noise & Multipath Distortion
c)
32767
4
Direct sequence spread spectrum
Multipath fading
C
Shortest uninterrupted waveform
MFSK
a
Option A
spread spectrum modulation
Yes
Large transmission bandwidth
a) Large transmission bandwidth
D
A
Frequency
c) Non deterministic
B
B
C
Large transmission BW
B
3. Band pass filter
A) Large transmission bandwidth
multiplying
a) Minimum number of chips necessary
Despreading & Demodulation
Total hopping bandwidth and instantaneous bandwidth
All of the above
c) Frequency follower & Repeat back jammers
B
Ans: All of the above
MFSK
31
D
C
D All of the above
A
unique PN code
Large transmission bandwidth
d) Total hopping bandwidth and instantaneous bandwidth
64 users
Option D
C.Non deterministic
Tc/Tb
B
B
A
Option A :TDMA
Maximum length p-n sequence generator
A
Frequency hopping spread spectrum
(2^N)-1
1 bit/ symbol
Sr. No. Unit V Question Unit V Answer Option A Unit V Answer Option B Unit V Answer Option C Unit V Answer Option D
1 The mutual information Is symmetric Always non negative Both a and b are correct None of the above
2 According to shannon HartlThe channel capacity become The channel capacity does Hasn a tradeoff between ba Both B and C are correct
3 Information Theoretic App A B C D
4 ______can be defined as aEntropy Information Uncertainty none of these
5 The negative statement forIf R > C, the error probabil If R < C, the error probabili Both a & b None of the above
6 The unit of average mutual Bits Bytes Bits per symbol Bytes per symbol
7 The mutual information betw a) Positive b) Negative c) Zero d) All of the mentioned
8 In discrete memoryless souPast output Future output Both a and b None of the above
9 Which of the following algoexhaustive search greedy algorithm brute force algorithm divide and conquer algorit
10 Q4. The information I contained
I = k log2 1/P I = k log2P I = k log21/2P I = k log21/P2
11 According to shanon Harte The channel capacity become Channel capacity does not Has
b a tradeoff between B Both B&C are correct
12 When the base of the logaria) Bits b) Bytes c) Nats d) None of the mentioned
13 The relation between entr a) I(X;Y) = H(X) - H(X/Y) b) I(X;Y) = H(X) - H(Y) c)I(X;Y) = H(X/Y) - H(Y/X) I(X;Y) = H(Y) - H(X)
14 Theachannel
Let capacity
source S{Xk} under4 Mbps
generate 20 Mbps
mutually independent symbols Xk, such that H(Xk) =8kkbps
for k≥ 4 kbps
15 1.Then, the entropy rate of this source is given by 0 1 1.5 Does not Exists
16 Information Theoretic App A B C D
17 Q] For Binary Symmetric CA] 1/3 B] 1/4 C]2/3 D] either 1/3 or 2/3
18 In discrete memoryless sour Past output b. Future output c. Both a and b d. None of the above
19 A digital communication sys7 Mbits/s 3.5 Mbits/s 7/4 Mbits/s 7 bits/s
20 Entropy is a a) path function, intensive pb) path function, extensive c) point function, intensive d) point function, extensive
21 Information rate is defined rH Information per unit time Average number of bits of All of the above
22 Information theoretic appr A B C D
23 Self information should be Positive Negative Positive & Negative None of the mentioned
24 In discrete
A channel memoryless
coding theorem, Maximum
source Minimum
is capable of transmitting 3 distinct symbols m0,m1Constant
and None of the above
25 m2.Their probabilities are ½,
1/2¼,bits
and ¼ respectively. What
3/2 bits
is the source entropy 2 bits 3 bits
26 3.How error detection and a) By passing it through eqb) By passing it through filt c) By amplifying it d) By adding redundancy bi
27 The technique that may be Shannon-Fano algorithm ASK FSK Digital modulation techniqu
28 Information theory A B C B4
29 Sun rises in east has infor 1 Infinite Unknown 0
30 Entropy is the measure of Randomness Information Randomness & InformationNone of the mentioned
31 Which is not source codingShannon Fano Huffman Run Length Encoding LBC
32 Which of the following is Huffman coding may becom Huffman Codes may not beIn Huffman coding, no codeAll of the above
33 Some properties of informatiIi ≥ 0, 0≤ Pi ≤ 1 Ii →0, if Pi → 1 Ii > I, j if Pi < Pj Ii = 0, Pi = 0
34 The channel capacity is The maximum information tInformation contained in a The amplitude of the modulAll of the above
35 Which of the following are Shannon Fano Huffman Coding Lemple Ziv Channel coding
36 Infinite bandwidth channel CALCULATE THE AMOUNT Noiseless
OF channel has ____c
A binary symmetric channeWhich distance is related
37 Yes Yes Yed Yes Yes
38 The unit of average mutual Bits Bytes Bits per symbol Bytes per symbol
39 The channel capacity is The maximum information tInformation contained in a The amplitude of the modulAll of the above
40 _____can be defined as a m Information Entropy Shanno None of these
41 Mutual information should Positive Negative can be positive and negati none
42 Entropy of a random variabl 0 1 Infinite Cannot be determined
43 For an information source S A. 2.5 bits per message sy B. 0.415 bits per message C. 1.5 bits per message sy D. 2 bits per message sym
44 Entropy is a path function, intensive pro path function, extensive prpoint function, intensive pr point function, extensive pr
45 Which among the followingJPEG H.263 MPEG All of the above
46 Which type of channel doeNoiseless Channel Lossless Channel Useless Channel Deterministic Channel
47 Self information should be Positive Negative Positive and negative None of above..
48 When probability of error duChannel is very noisy No information is received Channel is very noisy & NoNone of the mentioned
49 For M equally likely messa H = log10M H = log2M H = log10M2 H = 2log10M
50 When
The probability
technique thatofmay
errorbe
duChannel is very noisy
used to increase No information
average information is received
per bit is Channel is very noisy & NoNone of the mentioned
51 Shannon-Fano algorithm ASK fsk digital modulation techniqu
52 The channel capacity for a a) 20Mbps b) 30 Mbps c) 5Mbps d) 24 Mbps
53 Binary Huffman coding is aPrefix condition code Suffix condition code Prefix & Suffix condition coNone of the mentioned
54 The information Theory deal 1,2 are correct 2,3 are correct only 3 is correct 1,2 & 3 are correct
55 Redundancy
The minimumcan be determ
spacing 1-n consecutive hop positions
between 1+n gives the n-1 n+1
56 Minimum number of chips 2. Maximum number of chips 3. Chip
necessary
rate 4. None of the mentioned
57 which of the following algo Brute Force Algorithm Greedy Algorithm Divide and Conquer Algori Exhaustive Algorithm
58 Q. Which coding terminologa) Enciphering b) Deciphering c) Codeword d) Codebook
59 If the channel is bandlimite 15.15 kbps 24.74 kbps 30.12 kbps 52.18 kbps
60 Self information is always---p ositive negative
An analog baseband signal with highest frequency 200 Hz, is sampled at twice the zero none of these
61 Nyquist
One rate. The
possible samples
Huffmann are
code quantized
500for the DMSinto
bits/sec with5 source
message1000symbols that
bits/sec
probabilities occur
{0.35, independently
0.25, 1500
0.20, with probabilities p1
bits/sec
0.15, 2000  =1/2, p2
bits/sec = ¼, p3  = 1/8, p4 = p 5 =1/16. The informatio
62 0.05} is {0, 1, 10, 110, 111}. {00, 01, 10, 110, 111} {00, 01, 10, 111, 1111}. {00, 11, 10, 101, 111}.
63 Entropy is the measure of a) Randomness b) Information c) Randomness & Informatid) None of the mentioned
64 What is unit of information Bit Byte Word Decit
65 There are two probabilities H=9 H=2 H=7 H=1
66 Which of coding
Huffman the following algoexhaustive
technique is adopted forsearch
constructing greedy algorithm
the source brute force algorithm
code with redundancy. divide and conquer algorit
67 On which factor/s do/does the Maximum
channel capacity depend/s Constant Minimum
in the communication system? Unpredictable
68 Bandwidth Signal to Noise Ratio Both a and b None of the above
69 Coding efficiency n is givenTmin/T T/Tmin Tmax/T None of the above
70 The technique that may be Shannonu fano algorithm ASK FSK Digital modulation techniqu
71 Unit of information is not Base 2= bits base 10 =Hartleys Base e = nats Base 8 = octets
72 The relation between entro I(X;Y) = H(X) - H(X/Y) I(X;Y) = H(X/Y) - H(Y/X) I(X;Y) = H(X) - H(Y) I(X;Y) = H(Y) - H(X)
73 The entropy for a fair coin t5 bits 3 bits 2 bits 1 bit
74 an even-number of two no errors an odd-number of
75 When probability of error duChannel is very noisy No information is received Channel is very noisy & NoNone of the mentioned
76 a) Randomness b) Information c) Randomness & Informatd) None of the mentioned
77 The unit of average mutual Bits
inf Bytes Bits per symbol Bytes per symbol
78 Binary Huffman coding is aPrefix condition code Suffix condition code Prefix & Suffix condition coNone of the mentioned
79 Which of the following stateI(X;Y)=I(Y;X) I(X,W;Y,Z)=I(X;Y)+I(W;Z) I(X;Y)=I(Y)+I(X) Both a and b
80 For attenuation of high frequencies
shunt capacitance
we should use series capacitance inductance resistance
ANSWER UNIT V
Both a and b are correct
Both B and C are correct
Information Theoretic Approach to communication system
Entropy
If R > C, the error probability increases towards Unity
A--Bits
Answer: d
Both a and b
B
I = k log2 1/P
Both B &C are correct
c) Nats
a) I(X;Y) = H(X) - H(X/Y)
Option B:20 Mbps
Does not Exists
V
c] 2/3
C) Both a and b
7 Mbits/s
D
All of the above
Information theoretic approach to Communication system
Positive
Maximum
B - 3/2 bits
d)
Shannon-Fano algorithm
5
0
Randomness & Information
D
In Huffman coding, no code is prefix of any other code.
Ii = 0, Pi = 0
a
Option A & B
limited
Yes
Bits
a) The maximum information transmitted by one symbol over the channel
B
A
Infinite
C. 1.5 bits per message symbol
D
A
C
Positive
C
H = log2M
C)Channel is very noisy & No information is received
Shannon-Fano algorithm
b) 30 Mbps
Prefix condition code
1,2 & 3 are correct
1-n
Minimum number of chips necessary
B
Ans: Deciphering
24.74 kbps
positive
C
B
c) Randomness & Information
A
H=1
greedy algorithm
C. Minimum
Both a and b
Option A
A. Shannon Fano algorithm
Base 8 = octets
A
D
D
Option C:Channel is very noisy & No information is received
c) Randomness & Information
A
Prefix condition code
Both a and b
shunt capacitance
Sr. Unit VI Question Unit VI Answer Option A Unit VI Answer Option B Unit VI Answer Option C Unit VI Answer Option D
No.
1 For decoding in convolutionDiverge upward when a bit Diverge downward when a Diverge bi left when a bit is 0 Diverge right when a bit is
2 A simple parity check code An ca even number of An odd number of No errors A and B errors
3 Error-control coding A B C D
4 Regular parity check matr uniform row weight uniform column weight both of these none of these
5 How many redundant bits are n+k n-k k2 n2
6 A linear code Sum of code words is also All-zero code word is a co Minimum hamming distanceAll of the above
7 Which needs more check bia) Error correction b) Error detection c) Error correction & detectd) None of the mentioned
8 Which can be used as an int IP router Microwave router Telephone switch All of the mentioned
9 The cyclic codes are desig Shift registers with feedbacShift registers without feed Flip-flops None of the above
10 Q8 For the generation of a xn cycl+ 1 xn – 1 xn /2 x2n/3
11 Cyclic code can be generatGenerator polynomial Generator matrix Generator polynomial and m None of above
12 Which operates on continu Block codes b) Convolutional codes c) Block & Convolutional c d) None of the mentioned
13 Advantages of Turbo code a) ar 1 and 2 are advantages b) 1,2,3,4 All are advanta c) 1 and 4 are advantages d) 1, 2 and 4 are advantage
14 Convolutional code can be Coded bits Message bits Constraint length code rate
15 For a (7, 4) block code, 7 i Information bits Total Bits- Information bits Redundant Bits None
16 Error - Control Coding A B C D
17 Q] For (7,4) systematic cyclic A] code,
1111011if remainder polynomial
B] 1111110
is (x+1) then C] 1111111 D] 1111101
18 code word for message (1111)
Basically the Galois field Finite is * Infinite Both a and b none of the above
19 In LBC, the _____of any XOR two valid code words createsXNOR another valid code AND OR
20 word
What by using
is the operation
minimal Hammia) 1 b) 2 c) 3 d) 4
21 In channel coding theorem,c Maximum Minimum Constant Variable
22 Error control coding A B C D
23 The cyclic codes are desig Shift registers with feedbacShift registers without feed Flipflops None of the mentioned
24 In decoding of cyclic code Generator Polynomial Received code word Polyn Quotient Polynomial Remainder Polynomial
25 Which among the followingCode represents
Rate the code in which
Block
codewords
Codes consists of Systematic Codes Hamming Distance
26 message bitsuse
Checksums and_________
parity bitsa)separately?
arithmetic.
one’s complement arithmb) two’s complement arithmc) either (a) or (b) d) none of the above
27 On which factors does the  Bandwidth  Signal to Noise Ratio Both a & b Options None of a & b option
28 Error control coding A B C D
29 Which of the following is noCyclic codes RS codes Convolutional codes None
30 In synchronous transmissio4 bits 4 bits 4 bits 9 bits
31 To increase error probabili Increased Decreased Exponentially increased Exponentially decreased
32 ..............codes are speci non linear convolution cyclic none
33 For a LBC having (6,4) spec 1 2 3 4
34 Viterbi algorithm performs Maximum likelihood Maximum a posteriori Minimum square Minimum mean square
35 What is linearity property Difference of two codewordSum of two codeword givesAll zero codeword is a val Cyclic shift of a codeword
36 error control coding The cyclic codes are desigThe feedback shift register The c measure of the amountThe method used for represe
37 Yes Yes Yes Yes Yes
38 The cyclic codes are desig Shift registers with feedbacShift registers without feed Flipflops None of the above
39 Which can be used as an in IP router Microwave router Telephone switch All of the mentioned
40 The original ______ is a pashanno code turbo code Bhos code None of these
41 Which are uniquely decodaFixed length codes Variable length codes Fixed and Variable both none
42 How error detection and corBy passing it through equalBy passing it through filter By amplifying it By adding redundancy bits
43 Huffman coding is adopted A. Minimum B. Maximum C. Constant D. Unpredictable
44 The cyclic codes are desig Shift registers with feedbac Shift registers without fee Flipflops None of the mentioned
45 Block codes are generatedGenerator matrix Generator polynomial Generator polynomial & matNone of the mentioned
46 A burst error means that twdouble-bit burst single-bit none of the above
47 What is value of leading coe 0.5 1 4 16
48 Which can detect two bit erParity check Cyclic redundancy check Parity & Cyclic redundancyNone of the mentioned
49 __________codes are special Non-linear Convolution Cyclic none of the above
50 Which has comparatively hSine wave Cosine wave Square wave None of the mentioned
51 Which among the below stated A & logical
B circuits are present
C & in
D encoder and decoderA used& C for the implementation B& ofDcyclic codes?
52 A. Shiftamong
Which Registers
the below stated
a. C logical
& D circuits are presentb. A in
& encoder
B and decoderc.used
A&C for the implementationd. of
B& cyclic
D codes
53 A.
TheShift Registers
received code containsZero Non zero Infinity None of the mentioned
54 When the codes follows theNon-linear codes Erroneous code Redundant code Linear codes
55 Error control capability is Hamming weight Hamming distance Hamming codes All of the above
56 For any cyclic shift, the auto-correlation
1/p function is equal
b) -1/p
to c) –p d) p
57 Cyclic codes can be generaGenerator Matrix Generator Polynomial Generator Matrix and Poly None of the above
58 Q. Why do we require ha a)Error correction b) Encryption only c) Decryption d) Bit stuffing
59 In decoding of cyclic code Generator Polynomial Received code word Polyn Quotient Polynomial Remainder Polynomial
60 In Linear Block Codes (n,k)n= total no. of bits, k= mes n= message bits, k= total no n= parity bits, k= total no. oNone of these
61 In a linear block code, m less than equal to greater than none of the above
62 A cyclic code can be generGenerator polynomial Generator matrix Generator polynomial & matNone of the mentioned
63 According to linearity prop a. sum b. difference c. product d. division
64 Linear block codes are used Forward error correction Backward error correction Forward error detection Backward error detection
65 The relation between GenerGy * Hy = 1 GX * HT = 6 G * HT = 0 GT * HT = 0
66 The cyclic codes are desig Shift registers with feedbacShift registers without feed Flipflops None of the mentioned
67 The number of errors that canDmin+1
be corrected without erasure
Dmin information
–1 is (Dmin+1)/2 (Dmin – 1)/2
68 In channel coding theorem,Maximum Minimum Constant None of the above
69 Hamming weight of codewoNo. Of non zero elements iNo. Of zero elements in th Total no. Of elements in t No. Of elements in the parit
70 The cyclic codes are designShift registers with feedbacShift registers without feed Flipflops None of the mentioned
71 The LPDC stands for Low Density Parity Check List Density Parity Check Low Data Parity Check Long Data Parity Check
72 While decoding the cyclic code,
Zero if the received code wordUnity
is similar as transmitted Infinity
code word, then r(x) mod g(x)
Noneis of
equal
the above
to _________
73 A cyclic code can be generGenerator polynomial Generator matrix Generator polynomial & matNone of the mentioned
74 __________codes are special Non-linear
linear block codes withConvolution
one extra property. If a codeword
Cyclic is rotated, the resultnone
is another
of the codeword.
above
75 The cyclic codes are desi Shift registers with feedbacShift registers without feed Flipflops None of the mentioned
76 How error detection and cora) By passing it through eqb) By passing it through filt c) By amplifying it d) By adding redundancy bi
77 Which can be used as an int IP router Microwave router Telephone switch All of the mentioned
78 A cyclic code can be generGenerator polynomial Generator matrix Generator polynomial & matNone of the mentioned
79 A cyclic code can be generated
Generator
using Matrix Generator Ploynomial Syndrome Matrix Code Matrix
80 This set of Digital Communications
n layer Multiple Choice Questions
n-1 layer& Answers (MCQs)n+1 focuses
layer on “Error detection
none
andof correction
the mentioned
1”.
In layering, n layers provide service to
ANSWER UNIT VI

Diverge upward when a bit is 0 and diverge downward when the bit is 1
An odd number of
Information Theoretic Approach to communication system
both of these
n-k
D--All of the above
Answer: a
All of the mentioned
A
xn + 1
Generator polynomil
b) Convolutional codes
c) 1 and 4 are advantages
Option C:Constraint length
Information bits
UNIT VI
A] 1111011
A) Finite
XOR
C
Maximum
Error control coding
Shift registers with feedback
Remainder Polynomial
C- Systematic Code
a)
 Signal to Noise Ratio
6
Convolutional codes
9 bits
A
Cyclic
3
a
Option B
error control coding
Yes
Shift registers with feedback
All of the mentioned
B
A
By adding redundancy bits
A. Minimum
A
A
B
0.5
B
Cyclic
C) Square wave
A&B
b. A & B
Non zero
Linear codes
Hamming distance
b) -1/p
B
Ans: Error correction
Remainder Polynomial
n= total no. of bits, k= message bits
B
A
a. sum
A
G * HT = 0
Shift registers with feedback
D. (Dmin – 1)/2
Maximum
Option A
A.Shift registers with feedback
Low Density Parity Check
A
A
C
Option A: Shift registers with feedback
d) By adding redundancy bits
D
Generator polynomial
Generator polynomial
n+1 layer