1) In discrete memoryless source, the current letter produced by a source is statistically independent of _____
a. Past output
b. Future output
c. Both a and b
d. None of the above
|
2) Which coding terminology deals with the inverse operation of assigned words of second language corresponding to the words in the first language?
a. Enciphering
b. Deciphering
c. Codeword
d. Codebook
|
3) Huffman coding technique is adopted for constructing the source code with ________ redundancy.
a. Maximum
b. Constant
c. Minimum
d. Unpredictable
|
4) Which bitmap file format/s support/s the Run Length Encoding (RLE)?
a. TIFF
b. BMP
c. PCX
d. All of the above
|
5) In dictionary techniques for data compaction, which approach of building dictionary is used for the prior knowledge of probability of the frequently occurring patterns?
a. Static Dictionary
b. Adaptive Dictionary
c. Both a and b
d. None of the above
|
6) Which type of channel does not represent any correlation between input and output symbols?
a. Noiseless Channel
b. Lossless Channel
c. Useless Channel
d. Deterministic Channel
|
7) In digital communication system, smaller the code rate, _________are the redundant bits.
a. less
b. more
c. equal
d. unpredictable
|
8) In channel coding theorem, channel capacity decides the _________permissible rate at which error free transmission is possible.
a. Maximum
b. Minimum
c. Constant
d. None of the above
|
9) If the channel is bandlimited to 6 kHz & signal to noise ratio is 16, what would be the capacity of channel?
a. 15.15 kbps
b. 24.74 kbps
c. 30.12 kbps
d. 52.18 kbps
|
10) According to Shannon's second theorem, it is not feasible to transmit information over the channel with ______error probability, although by using any coding technique.
a. small
b. large
c. stable
d. unpredictable
|
11) Which among the following is/are the essential condition/s for a good error control coding technique?
a. Faster coding & decoding methods
b. Better error correcting capability
c. Maximum transfer of information in bits/sec
d. All of the above
|
12) Which among the following represents the code in which codewords consists of message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
|
13) In a linear code, the minimum Hamming distance between any two code words is ______minimum weight of any non-zero code word.
a. Less than
b. Greater than
c. Equal to
d. None of the above
|
14) Basically, Galois field consists of ______ number of elements.
a. Finite
b. Infinite
c. Both a and b
d. None of the above
|
15) The minimum distance of linear block code (dmin) is equal to minimum number of rows or columns of HT, whose _____ is equal to zero vector.
a. sum
b. difference
c. product
d. divison
|
16) According to linearity property, the ________ of two code words in a cyclic code is also a valid code word.
a. sum
b. difference
c. product
d. division
|
17) What is the value of leading coefficient of a monic polynomial?
a. 0.5
b. 1
c. 4
d. 16
|
18) While decoding the cyclic code, if the received code word is similar as transmitted code word, then r(x) mod g(x) is equal to _________
a. Zero
b. Unity
c. Infinity
d. None of the above
|
19) In decoding of cyclic code, which among the following is also regarded as 'Syndrome Polynomial'?
a. Generator Polynomial
b. Received code word Polynomial
c. Quotient Polynomial
d. Remainder Polynomial
|
20) For designing of (4,1) cyclic repetition code, what would be the order of the generator polynomial g(x)?
a. 1
b. 3
c. 4
d. 5
|
21) For (n,k) binary BCH code, how are the parity check bits (n – k) specified?
a. m + tc
b. m - tc
c. mtc
d. m/tc
|
22) BCH codes exhibit the multiple error correcting capability with the provision of selecting _________.
a. Alphabet size
b. Block length
c. Code rates
d. All of the above
|
23) Generally, a primitive polynomial of degree 'm' is an irreducible polynomial in such a way that it is a factor of xn + 1, where 'n' = ______
a. 2m - 1
b. m/n - 1
c. (m+1) /2
d. m-n-1
|
24) In minimal polynomial, _______degree polynomial is present with coefficients in the basefield along with the zeros in extension field.
a. largest
b. constant
c. smallest
d. unpredictable
|
25) Which type of ARQ system introduces the transmission delay between the transmitter and receiver before the reception of frame at receiver for the purpose of error detection?
a. Go-back-N ARQ
b. Selective Repeat ARQ
c. Stop-and-Wait ARQ
d. None of the above
|
26) At any given time, the output of an encoder depends on ______
a. Past input
b. Present input
c. Both a and b
d. None of the above
|
27) While representing the convolutional code by (n,k,m), what does 'm' signify or represent in it?
a. Coded bits
b. Message bits
c. Memory order
d. All of the above
|
28) During the shifting of bits in an encoder, how are the transitions in the states represented?
a. By lines
b. By circles
c. By summers
d. By squares
|
29) In Viterbi's algorithm, which metric is adopted for decision making?
a. Hamming distance
b. Galois Field
c. Hamming bound
d. Parity-check
|
30) In Viterbi's algorithm, the selected paths are regarded as __________
a. survivors
b. defenders
c. destroyers
d. carriers
|
31) For a baseband system with transmission rate 'rs' symbols/sec, what would be the required bandwidth?
a. rs / 2 Hz
b. rs / 4 Hz
c. rs / 8 Hz
d. rs / 16 Hz
|
32) For a Gaussian channel of 1 MHz bandwidth with the signal power to noise spectral density ratio of about 104 Hz, what would be the maximum information rate?
a. 12000 bits/sec
b. 14400 bits/sec
c. 28000 bits/sec
d. 32500 bits/sec
|
33) With respect to power-bandwidth trade-off, for reducing the transmit power requirement, the bandwidth needs to be ________.
a. Increased
b. Constant
c. Decreased
d. None of the above
|
34) In digital communication system, if both power and bandwidth are limited, then which mechanism/choice is preferred?
a. Power efficient modulation
b. Bandwidth efficient modulation
c. Error control coding
d. Trellis coded modulation
|
35) In coding gain & bandwidth of TCM, if the signal energy is kept constant, the ________of constellation reduces the noise margin and results into the degradation of performance.
a. Expansion
b. Compression
c. Both a and b
d. None of the above
|
