1) In uniform quantization process a.

Amplitude
a. The step size remains same b. Frequency
b. Step size varies according to the values c. Phase
of the input signal d. None of the above
c. The quantizer has linear characteristics ANSWER: (d) None of the above
d. Both a and c are correct
ANSWER: (d) Both a and c are correct 7) One of the disadvantages of PCM is
a. It requires large bandwidth
2) The process of converting the b. Very high noise
analog sample into discrete form is c. Cannot be decoded easily
called d. All of the above
a. Modulation ANSWER: (a) It requires large
b. Multiplexing bandwidth
c. Quantization
d. Sampling 8) The expression for bandwidth BW
ANSWER:(c) Quantization of a PCM system, where v is the
number of bits per sample and fm is the
3) The characteristics of compressor in modulating frequency, is given by
μ-law companding are a. BW ≥ vfm
a. Continuous in nature b. BW ≤ vfm
b. Logarithmic in nature c. BW ≥ 2 vfm
c. Linear in nature d. BW ≥ 1/2 vfm
d. Discrete in nature ANSWER: (a) BW ≥ vfm
ANSWER: (a) Continuous in nature
9) The error probability of a PCM is
4) The modulation techniques used to a. Calculated using noise and inter symbol
convert analog signal into digital signal interference
are b. Gaussian noise + error component due
a. Pulse code modulation to inter symbol interference
b. Delta modulation c. Calculated using power spectral density
c. Adaptive delta modulation d. All of the above
d. All of the above ANSWER: (d) All of the above
ANSWER: (d) All of the above
10) In Delta modulation,
5) The sequence of operations in which a. One bit per sample is transmitted
PCM is done is b. All the coded bits used for sampling are
a. Sampling, quantizing, encoding transmitted
b. Quantizing, encoding, sampling c. The step size is fixed
c. Quantizing, sampling, encoding d. Both a and c are correct
d. None of the above ANSWER: (d) Both a and c are correct
ANSWER:(a) Sampling, quantizing,
encoding 11) In digital transmission, the
modulation technique that requires
6) In PCM, the parameter varied in minimum bandwidth is
accordance with the amplitude of the a. Delta modulation
modulating signal is b. PCM
c. DPCM 17) The factors that cause quantizing
d. PAM error in delta modulation are
ANSWER: (a) Delta modulation a. Slope overload distortion
b. Granular noise
12) In Delta Modulation, the bit rate is c. White noise
a. N times the sampling frequency d. Both a and b are correct
b. N times the modulating frequency ANSWER:(d) Both a and b are correct
c. N times the nyquist criteria
d. None of the above 18) Granular noise occurs when
ANSWER: (a) N times the sampling a. Step size is too small
frequency b. Step size is too large
c. There is interference from the adjacent
13) In Differential Pulse Code channel
Modulation techniques, the decoding is d. Bandwidth is too large
performed by ANSWER: (b) Step size is too large
a. Accumulator
b. Sampler 19) The crest factor of a waveform is
c. PLL given as –
d. Quantizer a. 2Peak value/ rms value
ANSWER: (a) Accumulator b. rms value / Peak value
c. Peak value/ rms value
14) DPCM is a technique d. Peak value/ 2rms value
a. To convert analog signal into digital ANSWER: (c) Peak value/ rms value
signal
b. Where difference between successive
samples of the analog signals are encoded 20) The digital modulation technique
into n-bit data streams in which the step size is varied
c. Where digital codes are the quantized according to the variation in the slope
values of the predicted value of the input is called
d. All of the above a. Delta modulation
ANSWER: (d) All of the above b. PCM
c. Adaptive delta modulation
15) DPCM suffers from d. PAM
a. Slope over load distortion ANSWER: (c) Adaptive delta
b. Quantization noise modulation
c. Both a & b
d. None of the above 21) The digital modulation scheme in
ANSWER:(c) Both a & b which the step size is not fixed is
a. Delta modulation
16) The noise that affects PCM b. Adaptive delta modulation
a. Transmission noise c. DPCM
b. Quantizing noise d. PCM
c. Transit noise ANSWER:(b) Adaptive delta
d. Both a and b are correct modulation
ANSWER: (d) Both a and b are correct
22) In Adaptive Delta Modulation, the
slope error reduces and
a. Quantization error decreases the absence of noise
b. Quantization error increases c. They are used for signal detection
c. Quantization error remains same d. All of the above
d. None of the above ANSWER: (d) All of the above
ANSWER: (b) Quantization error
increases 28) Matched filters may be used
a. To estimate the frequency of the
23) The number of voice channels that received signal
can be accommodated for transmission b. In parameter estimation problems
in T1 carrier system is c. To estimate the distance of the object
a. 24 d. All of the above
b. 32 ANSWER: (d) All of the above
c. 56
d. 64 29) The process of coding multiplexer
ANSWER: (a) 24 output into electrical pulses or
waveforms for transmission is called
24) The maximum data transmission a. Line coding
rate in T1 carrier system is b. Amplitude modulation
a. 2.6 megabits per second c. FSK
b. 1000 megabits per second d. Filtering
c. 1.544 megabits per second ANSWER:(a) Line coding
d. 5.6 megabits per second
ANSWER: (c) 1.544 megabits per 30) For a line code, the transmission
second bandwidth must be
a. Maximum possible
25) T1 carrier system is used b. As small as possible
a. For PCM voice transmission c. Depends on the signal
b. For delta modulation d. None of the above
c. For frequency modulated signals ANSWER: (b) As small as possible
d. None of the above
ANSWER: (a) For PCM voice 31) Regenerative repeaters are used
transmission for
a. Eliminating noise
26) Matched filter may be optimally b. Reconstruction of signals
used only for c. Transmission over long distances
a. Gaussian noise d. All of the above
b. Transit time noise ANSWER:(d) All of the above
c. Flicker
d. All of the above 32) Scrambling of data is
ANSWER:(a) Gaussian noise a. Removing long strings of 1’s and 0’s
b. Exchanging of data
27) Characteristics of Matched filter c. Transmission of digital data
are d. All of the above
a. Matched filter is used to maximize ANSWER: (a) Removing long strings of
Signal to noise ratio even for non 1’s and 0’s
Gaussian noise
b. It gives the output as signal energy in
33) In polar RZ format for coding, ANSWER: (c) Manchester format
symbol ‘0’ is represented by
a. Zero voltage 38) The maximum synchronizing
b. Negative voltage capability in coding techniques is
c. Pulse is transmitted for half the duration present in
d. Both b and c are correct a. Manchester format
ANSWER: (d) Both b and c are correct b. Polar NRZ
c. Polar RZ
34) In a uni-polar RZ format, d. Polar quaternary NRZ
a. The waveform has zero value for ANSWER: (a) Manchester format
symbol ‘0’
b. The waveform has A volts for symbol 39) The advantage of using
‘1’ Manchester format of coding is
c. The waveform has positive and a. Power saving
negative values for ‘1’ and ‘0’ symbol b. Polarity sense at the receiver
respectively c. Noise immunity
d. Both a and b are correct d. None of the above
ANSWER: (d) Both a and b are correct ANSWER: (a) Power saving

35) Polar coding is a technique in 40) Alternate Mark Inversion (AMI) is

which also known as
a. 1 is transmitted by a positive pulse and a. Pseudo ternary coding
0 is transmitted by negative pulse b. Manchester coding
b. 1 is transmitted by a positive pulse and c. Polar NRZ format
0 is transmitted by zero volts d. None of the above
c. Both a & b ANSWER:(a) Pseudo ternary coding
d. None of the above
ANSWER: (a) 1 is transmitted by a 41) In DPSK technique, the technique
positive pulse and 0 is transmitted by used to encode bits is
negative pulse a. AMI
b. Differential code
36) The polarities in NRZ format use c. Uni polar RZ format
a. Complete pulse duration d. Manchester format
b. Half duration ANSWER: (b)Differential code
c. Both positive as well as negative value
d. Each pulse is used for twice the 42) The channel capacity according to
duration Shannon’s equation is
ANSWER: (a) Complete pulse duration a. Maximum error free communication
b. Defined for optimum system
37) The format in which the positive c. Information transmitted
half interval pulse is followed by a d. All of the above
negative half interval pulse for ANSWER: (d) All of the above
transmission of ‘1’ is
a. Polar NRZ format 43) For a binary symmetric channel,
b. Bipolar NRZ format the random bits are given as
c. Manchester format a. Logic 1 given by probability P and
d. None of the above logic 0 by (1-P)
b. Logic 1 given by probability 1-P and c. Both a and b are correct
logic 0 by P d. None of the above
c. Logic 1 given by probability P2 and ANSWER: (c) Both a and b are correct
logic 0 by 1-P
d. Logic 1 given by probability P and 49) The relation between entropy and
logic 0 by (1-P)2 mutual information is
ANSWER: (a) Logic 1 given by a. I(X;Y) = H(X) – H(X/Y)
probability P and logic 0 by (1-P) b. I(X;Y) = H(X/Y) – H(Y/X)
c. I(X;Y) = H(X) – H(Y)
44) The technique that may be used to d. I(X;Y) = H(Y) – H(X)
increase average information per bit is ANSWER:(a) I(X;Y) = H(X) – H(X/Y)
a. Shannon-Fano algorithm
b. ASK 50) Entropy is
c. FSK a. Average information per message
d. Digital modulation techniques b. Information in a signal
ANSWER: (a) Shannon-Fano c. Amplitude of signal
algorithm d. All of the above
ANSWER: (a) Average information per
45) Code rate r, k information bits and message
n as total bits, is defined as
a. r = k/n 51) The memory less source refers to
b. k = n/r a. No previous information
c. r = k * n b. No message storage
d. n = r * k c. Emitted message is independent of
ANSWER: (a) r = k/n previous message
d. None of the above
46) The information rate R for given ANSWER: (c) Emitted message is
average information H= 2.0 for analog independent of previous message
signal band limited to B Hz is
a. 8 B bits/sec 52) The information I contained in a
b. 4 B bits/sec message with probability of occurrence
c. 2 B bits/sec is given by (k is constant)
d. 16 B bits/sec a. I = k log21/P
ANSWER:(b) 4 B bits/sec b. I = k log2P
c. I = k log21/2P
47) Information rate is defined as d. I = k log21/P2
a. Information per unit time ANSWER:(a) I = k log21/P
b. Average number of bits of information
per second 53) The expected information
c. rH contained in a message is called
d. All of the above a. Entropy
ANSWER: (d) All of the above b. Efficiency
c. Coded signal
48) The mutual information d. None of the above
a. Is symmetric ANSWER: (a) Entropy
b. Always non negative
54) Overhead bits are
a. Framing and synchronizing bits 60) Synchronization of signals is done
b. Data due to noise using
c. Encoded bits a. Pilot clock
d. None of the above b. Extracting timing information from the
ANSWER: (a) Framing and received signal
synchronizing bits c. Transmitter and receiver connected to
master timing source
55) ISI may be removed by using d. All of the above
a. Differential coding ANSWER:(d) All of the above
b. Manchester coding
c. Polar NRZ 61) Graphical representation of linear
d. None of the above block code is known as
ANSWER: (a) Differential coding a. Pi graph
b. Matrix
56) Timing jitter is c. Tanner graph
a. Change in amplitude d. None of the above
b. Change in frequency ANSWER: (c) Tanner graph
c. Deviation in location of the pulses
d. All of the above 62) A linear code
ANSWER: (c) Deviation in location of a. Sum of code words is also a code word
the pulses b. All-zero code word is a code word
c. Minimum hamming distance between
57) Probability density function two code words is equal to weight of any
defines non zero code word
a. Amplitudes of random noise d. All of the above
b. Density of signal ANSWER: (d) All of the above
c. Probability of error
d. All of the above 63) For decoding in convolution
ANSWER: (a) Amplitudes of random coding, in a code tree,
noise a. Diverge upward when a bit is 0 and
diverge downward when the bit is 1
58) Impulse noise is caused due to b. Diverge downward when a bit is 0 and
a. Switching transients diverge upward when the bit is 1
b. Lightening strikes c. Diverge left when a bit is 0 and diverge
c. Power line load switching right when the bit is 1
d. All of the above d. Diverge right when a bit is 0 and
ANSWER: (d) All of the above diverge left when the bit is 1
ANSWER: (a)Diverge upward when a
59) In coherent detection of signals, bit is 0 and diverge downward when the
a. Local carrier is generated bit is 1
b. Carrier of frequency and phase as same
as transmitted carrier is generated 64) The code in convolution coding is
c. The carrier is in synchronization with generated using
modulated carrier a. EX-OR logic
d. All of the above b. AND logic
ANSWER: (d) All of the above c. OR logic
d. None of the above
ANSWER: (a) EX-OR logic 70) For hamming distance dmin and
number of errors D, the condition for
65) Interleaving process permits a receiving invalid codeword is
burst of B bits, with l as consecutive a. D ≤ dmin + 1
code bits and t errors when b. D ≤ dmin – 1
a. B ≤ 2tl c. D ≤ 1 – dmin
b. B ≥ tl d. D ≤ dmin
c. B ≤ tl/2 ANSWER:(b) D ≤ dmin – 1
d. B ≤ tl
ANSWER: (d) B ≤ tl 71) Run Length Encoding is used for
a. Reducing the repeated string of
66) For a (7, 4) block code, 7 is the characters
total number of bits and 4 is the b. Bit error correction
number of c. Correction of error in multiple bits
a. Information bits d. All of the above
b. Redundant bits ANSWER: (a) Reducing the repeated
c. Total bits- information bits string of characters
d. None of the above
ANSWER: (a) Information bits 72) The prefix code is also known as
a. Instantaneous code
67) Parity bit coding may not be used b. Block code
for c. Convolutional code
a. Error in more than single bit d. Parity bit
b. Which bit is in error ANSWER: (a) Instantaneous code
c. Both a & b
d. None of the above 73) The minimum distance for
ANSWER: (c) Both a & b unextended Golay code is
a. 8
68) Parity check bit coding is used for b. 9
a. Error correction c. 7
b. Error detection d. 6
c. Error correction and detection ANSWER: (c) 7
d. None of the above
ANSWER: (b) Error detection 74) The Golay code (23,12) is a
codeword of length 23 which may
69) For hamming distance dmin and t correct
errors in the received word, the a. 2 errors
condition to be able to correct the b. 3 errors
errors is c. 5 errors
a. 2t + 1 ≤ dmin d. 8 errors
b. 2t + 2 ≤ dmin ANSWER: (b) 3 errors
c. 2t + 1 ≤ 2dmin
d. Both a and b 75) Orthogonality of two codes means
ANSWER: (d) Both a and b a. The integrated product of two different
code words is zero
b. The integrated product of two different
code words is one
c. The integrated product of two same 80) The capacity of a binary
code words is zero symmetric channel, given H(P) is
d. None of the above binary entropy function is
ANSWER: (a) The integrated product a. 1 – H(P)
of two different code words is zero b. H(P) – 1
c. 1 – H(P)2
76) The probability density function of d. H(P)2 – 1
a Markov process is ANSWER:(a) 1 – H(P)
a. p(x1,x2,x3…….xn) =
p(x1)p(x2/x1)p(x3/x2)…….p(xn/xn-1) 81) According to Shannon Hartley
b. p(x1,x2,x3…….xn) = theorem,
p(x1)p(x1/x2)p(x2/x3)…….p(xn-1/xn) a. The channel capacity becomes infinite
c. p(x1,x2,x3……xn) = p(x1)p(x2)p(x3) with infinite bandwidth
…….p(xn) b. The channel capacity does not become
d. p(x1,x2,x3……xn) = p(x1)p(x2 * infinite with infinite bandwidth
x1)p(x3 * x2)……..p(xn * xn-1) c. Has a tradeoff between bandwidth and
ANSWER:(a) p(x1,x2,x3…….xn) = Signal to noise ratio
p(x1)p(x2/x1)p(x3/x2)…….p(xn/xn-1) d. Both b and c are correct
ANSWER: (d) Both b and c are correct
77) The capacity of Gaussian channel
is 82) The negative statement for
a. C = 2B(1+S/N) bits/s Shannon’s theorem states that
b. C = B2(1+S/N) bits/s a. If R > C, the error probability increases
c. C = B(1+S/N) bits/s towards Unity
d. C = B(1+S/N)2 bits/s b. If R < C, the error probability is very
ANSWER: (c) C = B(1+S/N) bits/s small
c. Both a & b
78) For M equally likely messages, the d. None of the above
average amount of information H is ANSWER: (a) If R > C, the error
a. H = log10M probability increases towards Unity
b. H = log2M
c. H = log10M2 83) For M equally likely messages,
d. H = 2log10M M>>1, if the rate of information R ≤ C,
ANSWER:(b) H = log2M the probability of error is
a. Arbitrarily small
79) The channel capacity is b. Close to unity
a. The maximum information transmitted c. Not predictable
by one symbol over the channel d. Unknown
b. Information contained in a signal ANSWER: (a) Arbitrarily small
c. The amplitude of the modulated signal
d. All of the above 84) For M equally likely messages,
ANSWER: (a) The maximum M>>1, if the rate of information R > C,
information transmitted by one symbol the probability of error is
over the channel a. Arbitrarily small
b. Close to unity
c. Not predictable
d. Unknown
ANSWER: (b) Close to unity c. Height of the eye opening of eye pattern
d. All of the above
85) In Alternate Mark Inversion ANSWER:(a) Width of eye opening of
(AMI) is eye pattern
a. 0 is encoded as positive pulse and 1 is
encoded as negative pulse 90) For a noise to be white Gaussian
b. 0 is encoded as no pulse and 1 is noise, the optimum filter is known as
encoded as negative pulse a. Low pass filter
c. 0 is encoded as negative pulse and 1 is b. Base band filter
encoded as positive pulse c. Matched filter
d. 0 is encoded as no pulse and 1 is d. Bessel filter
encoded as positive or negative pulse ANSWER:(c) Matched filter
ANSWER: (b) 0 is encoded as no pulse
and 1 is encoded as positive or negative 91) Matched filters are used
pulse a. For maximizing signal to noise ratio
b. For signal detection
86) Advantages of using AMI c. In radar
a. Needs least power as due to opposite d. All of the above
polarity ANSWER: (d) All of the above
b. Prevents build-up of DC
c. May be used for longer distance 92) The number of bits of data
d. All of the above transmitted per second is called
ANSWER: (d)All of the above a. Data signaling rate
b. Modulation rate
87) The interference caused by the c. Coding
adjacent pulses in digital transmission d. None of the above
is called ANSWER: (a) Data signaling rate
a. Inter symbol interference
b. White noise 93) Pulse shaping is done
c. Image frequency interference a. to control Inter Symbol Interference
d. Transit time noise b. by limiting the bandwidth of
ANSWER: (a) Inter symbol transmission
interference c. after line coding and modulation of
signal
88) Eye pattern is d. All of the above
a. Is used to study ISI ANSWER: (d) All of the above
b. May be seen on CRO
c. Resembles the shape of human eye 94) The criterion used for pulse
d. All of the above shaping to avoid ISI is
ANSWER: (d) All of the above a. Nyquist criterion
b. Quantization
89) The time interval over which the c. Sample and hold
received signal may be sampled without d. PLL
error may be explained by ANSWER: (a) Nyquist criterion
a. Width of eye opening of eye pattern
b. Rate of closure of eye of eye pattern 95) The filter used for pulse shaping is
a. Raised – cosine filter channel
b. Sinc shaped filter c. Is done using linear filters
c. Gaussian filter d. All of the above
d. All of the above ANSWER: (d) All of the above
ANSWER: (d) All of the above
101) Zero forced equalizers are used
96) Roll – off factor is defined as for
a. The bandwidth occupied beyond the a. Reducing ISI to zero
Nyquist Bandwidth of the filter b. Sampling
b. The performance of the filter or device c. Quantization
c. Aliasing effect d. None of the abov
d. None of the above ANSWER: (a)Reducing ISI to zero
ANSWER: (a) The bandwidth occupied
beyond the Nyquist Bandwidth of the 102) The transmission bandwidth of
filter the raised cosine spectrum is given by
a. Bt = 2w(1 + α)
97) Nyquist criterion helps in b. Bt = w(1 + α)
a. Transmitting the signal without ISI c. Bt = 2w(1 + 2α)
b. Reduction in transmission bandwidth d. Bt = 2w(2 + α)
c. Increase in transmission bandwidth ANSWER: (a) Bt = 2w(1 + α)
d. Both a and b
ANSWER: (d) Both a and b 103) The preferred orthogonalization
process for its numerical stability is
98) The Nyquist theorem is a. Gram- Schmidt process
a. Relates the conditions in time domain b. House holder transformation
and frequency domain c. Optimization
b. Helps in quantization d. All of the above
c. Limits the bandwidth requirement ANSWER: (b) House holder
d. Both a and c transformation
ANSWER: (d) Both a and c
104) For two vectors to be
99) The difficulty in achieving the orthonormal, the vectors are also said
Nyquist criterion for system design is to be orthogonal. The reverse of the
a. There are abrupt transitions obtained at same
edges of the bands a. Is true
b. Bandwidth criterion is not easily b. Is not true
achieved c. Is not predictable
c. Filters are not available d. None of the above
d. None of the above ANSWER: (b) Is not true
ANSWER: (a) There are abrupt
transitions obtained at edges of the 105) Orthonormal set is a set of all
bands vectors that are
a. Mutually orthonormal and are of unit
100) Equalization in digital length
communication b. Mutually orthonormal and of null
a. Reduces inter symbol interference length
b. Removes distortion caused due to
c. Both a & b c. 2Π
d. None of the above d. 0
ANSWER: (a) Mutually orthonormal ANSWER: (b) Π
and are of unit length
111) BPSK system modulates at the
106) In On-Off keying, the carrier rate of
signal is transmitted with signal value a. 1 bit/ symbol
‘1’ and ‘0’ indicates b. 2 bit/ symbol
a. No carrier c. 4 bit/ symbol
b. Half the carrier amplitude d. None of the above
c. Amplitude of modulating signal ANSWER: (a) 1 bit/ symbol
d. None of the above
ANSWER: (a) No carrier 112) The BPSK signal has +V volts
and -V volts respectively to represent
107) ASK modulated signal has the a. 1 and 0 logic levels
bandwidth b. 11 and 00 logic levels
a. Same as the bandwidth of baseband c. 10 and 01 logic levels
signal d. 00 and 11 logic levels
b. Half the bandwidth of baseband signal ANSWER: (a) 1 and 0 logic levels
c. Double the bandwidth of baseband
signal 113) The binary waveform used to
d. None of the above generate BPSK signal is encoded in
ANSWER: (a) Same as the bandwidth a. Bipolar NRZ format
of baseband signal b. Manchester coding
c. Differential coding
108) Coherent detection of binary d. None of the above
ASK signal requires ANSWER: (a) Bipolar NRZ format
a. Phase synchronization
b. Timing synchronization 114) The bandwidth of BFSK is
c. Amplitude synchronization ______________ than BPSK.
d. Both a and b a. Lower
ANSWER: (d) Both a and b b. Same
c. Higher
109) The probability of error of DPSK d. Not predictable
is ______________ than that of BPSK. ANSWER: (c) Higher
a. Higher
b. Lower 115) In Binary FSK, mark and space
c. Same respectively represent
d. Not predictable a. 1 and 0
ANSWER: (a) Higher b. 0 and 1
c. 11 and 00
110) In Binary Phase Shift Keying d. 00 and 11
system, the binary symbols 1 and 0 are ANSWER: (a) 1 and 0
represented by carrier with phase shift
of 116) The frequency shifts in the BFSK
a. Π/2 usually lies in the range
b. Π
a. 50 to 1000 Hz
b. 100 to 2000 Hz 122) Minimum shift keying is similar
c. 200 to 500 Hz to
d. 500 to 10 Hz a. Continuous phase frequency shift
ANSWER: (a) 50 to 1000 Hz keying
b. Binary phase shift keying
117) The spectrum of BFSK may be c. Binary frequency shift keying
viewed as the sum of d. QPSK
a. Two ASK spectra ANSWER: (a) Continuous phase
b. Two PSK spectra frequency shift keying
c. Two FSK spectra
d. None of the above 123) In MSK, the difference between
ANSWER: (a) Two ASK spectra the higher and lower frequency is
a. Same as the bit rate
118) The maximum bandwidth is b. Half of the bit rate
occupied by c. Twice of the bit rate
a. ASK d. Four time the bit rate
b. BPSK ANSWER: (b) Half of the bit rate
c. FSK
d. None of the above 124) The technique that may be used
ANSWER: (c) FSK to reduce the side band power is
a. MSK
119) QPSK is a modulation scheme b. BPSK
where each symbol consists of c. Gaussian minimum shift keying
a. 4 bits d. BFSK
b. 2 bits ANSWER: (c) Gaussian minimum shift
c. 1 bits keying
d. M number of bits, depending upon the
requireme
ANSWER: (b) 2 bits

120) The data rate of QPSK is

___________ of BPSK.
a. Thrice
b. Four times
c. Twice
d. Same
ANSWER: (c) Twice

121) QPSK system uses a phase shift

of
a. Π
b. Π/2
c. Π/4
d. 2Π
ANSWER: (b) Π/2