MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 375 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
Which are the design options for anti jam communicator? |
| A. | time diversity |
| B. | frequency diversity |
| C. | special discrimination |
| D. | all of the mentioned |
| Answer» E. | |
| 102. |
Pulse jammer consists of |
| A. | pulse modulated excess band noise |
| B. | pulse modulated band-limited noise |
| C. | pulse width modulated excess band noise |
| D. | pulse width modulated band-limited noise |
| Answer» C. pulse width modulated excess band noise | |
| 103. |
Which method is better? |
| A. | to share same bandwidth |
| B. | to share different bandwidth |
| C. | to share same & different bandwidth |
| D. | none of the mentioned |
| Answer» C. to share same & different bandwidth | |
| 104. |
For any cyclic shift, the auto-correlation function is equal to |
| A. | 1/p |
| B. | -1/p |
| C. | –p |
| D. | p |
| Answer» C. –p | |
| 105. |
The sequences produced by shift register depends on |
| A. | number of stages |
| B. | feedback tap connections |
| C. | initial conditions |
| D. | all of the mentioned |
| Answer» E. | |
| 106. |
For maximal length sequence, the sequence repetition clock pulses p is given by |
| A. | 2n + 1 |
| B. | 2n -1 |
| C. | 2n |
| D. | none of the mentioned |
| Answer» C. 2n | |
| 107. |
If the initial pulse of 1000 is fed to shift register, after how many clock pulses does the sequence repeat? |
| A. | 15 |
| B. | 16 |
| C. | 14 |
| D. | 17 |
| Answer» B. 16 | |
| 108. |
A linear feedback shift register consists of |
| A. | feedback path |
| B. | modulo 2 adder |
| C. | four stage register |
| D. | all of the mentioned |
| Answer» E. | |
| 109. |
The shift register needs to be controlled by clock pulses. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 110. |
The properties used for pseudorandom sequence are |
| A. | balance |
| B. | run |
| C. | correlation |
| D. | all of the mentioned |
| Answer» E. | |
| 111. |
Pseudorandom signal                  predicted. |
| A. | can be |
| B. | cannot be |
| C. | maybe |
| D. | none of the mentioned |
| Answer» B. cannot be | |
| 112. |
Which decoding method involves the evaluation by means of Fano’s algorithm? |
| A. | maximum likelihood decoding |
| B. | sequential decoding |
| C. | maximum a priori |
| D. | minimum mean square |
| Answer» C. maximum a priori | |
| 113. |
Which of the following is not an error correction and detection code? |
| A. | block code |
| B. | convolutional codes |
| C. | passive codes |
| D. | turbo codes |
| Answer» D. turbo codes | |
| 114. |
In Viterbi’s algorithm, the selected paths are regarded as |
| A. | survivors |
| B. | defenders |
| C. | destroyers |
| D. | carriers |
| Answer» B. defenders | |
| 115. |
Which of the following is not an advantage of Fano’s algorithm in comparison to Viterbi’s algorithm? |
| A. | less storage |
| B. | large constraint length |
| C. | error rate |
| D. | small delays |
| Answer» E. | |
| 116. |
Fano’s algorithm searches all the paths of trellis diagram at same time to find the most probable path. |
| A. | true |
| B. | false |
| Answer» C. | |
| 117. |
Which of the following is not an algorithm for decoding convolution codes? |
| A. | viterbi algorithm |
| B. | stack algorithm |
| C. | fano’s sequential coding |
| D. | ant colony optimization |
| Answer» E. | |
| 118. |
In comparison to stack algorithm, Fano’s algorithm is simpler. |
| A. | true |
| B. | false |
| Answer» C. | |
| 119. |
Which of the following indicates the number of input bits that the current output is dependent upon? |
| A. | constraint length |
| B. | code length |
| C. | search window |
| D. | information rate |
| Answer» B. code length | |
| 120. |
Block codes can achieve a larger coding gain than convolution coding. |
| A. | true |
| B. | false |
| Answer» C. | |
| 121. |
Which of the following is not a way to represent convolution code? |
| A. | state diagram |
| B. | trellis diagram |
| C. | tree diagram |
| D. | linear matrix |
| Answer» E. | |
| 122. |
In soft decision approach 0 represents |
| A. | certainly one |
| B. | certainly zero |
| C. | very likely zero |
| D. | could be either zero or one |
| Answer» E. | |
| 123. |
In soft decision approach 100 means? |
| A. | certainly one |
| B. | certainly zero |
| C. | very likely zero |
| D. | very likely one |
| Answer» E. | |
| 124. |
In soft decision approach what does -127 mean? |
| A. | certainly one |
| B. | certainly zero |
| C. | very likely zero |
| D. | very likely one |
| Answer» C. very likely zero | |
| 125. |
The inter leaver connected between the two decoders is used to |
| A. | remove error bursts |
| B. | scatter error bursts |
| C. | add error bursts |
| D. | none of the mentioned |
| Answer» C. add error bursts | |
| 126. |
Decoders are connected in series. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 127. |
Components used for generation of turbo codes are |
| A. | inter leavers |
| B. | punching pattern |
| C. | inter leavers & punching pattern |
| D. | none of the mentioned |
| Answer» D. none of the mentioned | |
| 128. |
Turbo codes are |
| A. | forward error correction codes |
| B. | backward error correction codes |
| C. | error detection codes |
| D. | none of the mentioned |
| Answer» B. backward error correction codes | |
| 129. |
Average effective information is obtained by |
| A. | subtracting equivocation from entropy |
| B. | adding equivocation with entropy |
| C. | ratio of number of error bits by total number of bits |
| D. | none of the mentioned |
| Answer» B. adding equivocation with entropy | |
| 130. |
For a error free channel, conditional probability should be |
| A. | zero |
| B. | one |
| C. | equal to joint probability |
| D. | equal to individual probability |
| Answer» B. one | |
| 131. |
Equivocation is the |
| A. | conditional entropy |
| B. | joint entropy |
| C. | individual entropy |
| D. | none of the mentioned |
| Answer» B. joint entropy | |
| 132. |
Entropy is the measure of |
| A. | amount of information at the output |
| B. | amount of information that can be transmitted |
| C. | number of error bits from total number of bits |
| D. | none of the mentioned |
| Answer» B. amount of information that can be transmitted | |
| 133. |
Which parameter is called as Shannon limit? |
| A. | pb/n0 |
| B. | eb/n0 |
| C. | ebn0 |
| D. | none of the mentioned |
| Answer» C. ebn0 | |
| 134. |
The capacity relationship is given by |
| A. | c = w log2 ( 1+s/n ) |
| B. | c = 2w log2 ( 1+s/n ) |
| C. | c = w log2 ( 1-s/n ) |
| D. | c = w log10 ( 1+s/n ) |
| Answer» B. c = 2w log2 ( 1+s/n ) | |
| 135. |
The minimum nyquist bandwidth needed for baseband transmission of Rs symbols per second is |
| A. | rs |
| B. | 2rs |
| C. | rs/2 |
| D. | rs2 |
| Answer» D. rs2 | |
| 136. |
A function f(x) is even, when? |
| A. | f(x) = -f(x) |
| B. | f(x) = f(-x) |
| C. | f(x) = -f(x)f(-x) |
| D. | f(x) = f(x)f(-x) |
| Answer» C. f(x) = -f(x)f(-x) | |
| 137. |
Relationship between amplitude and frequency is represented by |
| A. | time-domain plot |
| B. | phase-domain plot |
| C. | frequency-domain plot |
| D. | amplitude-domain plot |
| Answer» D. amplitude-domain plot | |
| 138. |
Low frequency noise is |
| A. | flicker noise |
| B. | shot noise |
| C. | thermal noise |
| D. | partition noise |
| Answer» B. shot noise | |
| 139. |
What is the advantage of superheterodyning? |
| A. | high selectivity and sensitivity |
| B. | low bandwidth |
| C. | low adjacent channel rejection |
| D. | low fidelity |
| Answer» B. low bandwidth | |
| 140. |
Agreement between communication devices are called |
| A. | transmission medium |
| B. | channel |
| C. | protocol |
| D. | modem |
| Answer» D. modem | |
| 141. |
Noise is added to a signal |
| A. | in the channel |
| B. | at receiving antenna |
| C. | at transmitting antenna |
| D. | during regeneration of information |
| Answer» B. at receiving antenna | |
| 142. |
Sum of a periodic and aperiodic signal always be an aperiodic signal. |
| A. | true |
| B. | false |
| Answer» C. | |
| 143. |
What is the role of channel in communication system? |
| A. | acts as a medium to send message signals from transmitter to receiver |
| B. | converts one form of signal to other |
| C. | allows mixing of signals |
| D. | helps to extract original signal from incoming signal |
| Answer» B. converts one form of signal to other | |
| 144. |
Sin wave is |
| A. | aperiodic signal |
| B. | periodic signal |
| C. | random signal |
| D. | deterministic signal |
| Answer» C. random signal | |
| 145. |
What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists? |
| A. | o(c) |
| B. | o(log c) |
| C. | o(c log c) |
| D. | o(c2) |
| Answer» E. | |
| 146. |
What is the running time of the Huffman encoding algorithm? |
| A. | o(c) |
| B. | o(log c) |
| C. | o(c log c) |
| D. | o( n log c) |
| Answer» D. o( n log c) | |
| 147. |
Notch is a |
| A. | high pass filter |
| B. | low pass filter |
| C. | band stop filter |
| D. | band pass filter |
| Answer» D. band pass filter | |
| 148. |
The type of encoding where no character code is the prefix of another character code is called? |
| A. | optimal encoding |
| B. | prefix encoding |
| C. | frequency encoding |
| D. | trie encoding |
| Answer» C. frequency encoding | |
| 149. |
An optimal code will always be present in a full tree. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 150. |
What will be the cost of the code if character ci is at depth di and occurs at frequency fi? |
| A. | cifi |
| B. | ∫cifi |
| C. | ∑fidi |
| D. | fidi |
| Answer» D. fidi | |