Question 1

The code length does not depend on the frequency of occurrence of characters.

Accepted Answer

A) True 
 B)False

Question 2

What is the advantage of superheterodyning?

Accepted Answer

A) high selectivity and sensitivity 
B) low bandwidth 
C) low adjacent channel rejection 
D) low fidelity 
A) high selectivity and sensitivity 
B) low bandwidth 
C) low adjacent channel rejection 
D) low fidelity

Question 3

Which achieves greater compression?

Accepted Answer

A) lossless coding 
B) lossy coding 
C) lossless & lossy coding 
D) none of the mentioned 
A) lossless coding 
B) lossy coding 
C) lossless & lossy coding 
D) none of the mentioned

Question 4

Which bit is reserved as a parity bit in an ASCII set?

Accepted Answer

A) first 
B) seventh 
C) eighth 
D) tenth 
A) first 
B) seventh 
C) eighth 
D) tenth

Question 5

Which of the following algorithms is the best approach for solving Huffman codes?

Accepted Answer

A) exhaustive search 
B) greedy algorithm 
C) brute force algorithm 
D) divide and conquer algorithm 
A) exhaustive search 
B) greedy algorithm 
C) brute force algorithm 
D) divide and conquer algorithm

Question 6

Equivocation is the

Accepted Answer

A) conditional entropy 
B) joint entropy 
C) individual entropy 
D) none of the mentioned 
A) conditional entropy 
B) joint entropy 
C) individual entropy 
D) none of the mentioned

Question 7

Notch is a_________

Accepted Answer

A) high pass filter 
B) low pass filter 
C) band stop filter 
D) band pass filter 
A) high pass filter 
B) low pass filter 
C) band stop filter 
D) band pass filter

Question 8

Mutual information should be

Accepted Answer

A) positive 
B) negative 
C) positive & negative 
D) none of the mentioned 
A) positive 
B) negative 
C) positive & negative 
D) none of the mentioned

Question 9

Sin wave is_________

Accepted Answer

A) aperiodic signal 
B) periodic signal 
C) random signal 
D) deterministic signal 
A) aperiodic signal 
B) periodic signal 
C) random signal 
D) deterministic signal

Question 10

Lempel-Ziv algorithm is

Accepted Answer

A) variable to fixed length algorithm 
B) fixed to variable length algorithm 
C) fixed to fixed length algorithm 
D) variable to variable length algorithm 
A) variable to fixed length algorithm 
B) fixed to variable length algorithm 
C) fixed to fixed length algorithm 
D) variable to variable length algorithm

Question 11

ASCII code is a

Accepted Answer

A) fixed length code 
B) variable length code 
C) fixed & variable length code 
D) none of the mentioned 
A) fixed length code 
B) variable length code 
C) fixed & variable length code 
D) none of the mentioned

Question 12

Which is easier to implement and is preferred?

Accepted Answer

A) coherent system 
B) non coherent system 
C) coherent & non coherent system 
D) none of the mentioned 
A) coherent system 
B) non coherent system 
C) coherent & non coherent system 
D) none of the mentioned

Question 13

The type of encoding where no character code is the prefix of another character code is called?

Accepted Answer

A) optimal encoding 
B) prefix encoding 
C) frequency encoding 
D) trie encoding 
A) optimal encoding 
B) prefix encoding 
C) frequency encoding 
D) trie encoding

Question 14

What will be the cost of the code if character ci is at depth di and occurs at frequency fi?

Accepted Answer

A) cifi 
B) ?cifi 
C) ?fidi 
D) fidi 
A) cifi 
B) ?cifi 
C) ?fidi 
D) fidi

Question 15

Agreement between communication devices are called_________

Accepted Answer

A) transmission medium 
B) channel 
C) protocol 
D) modem 
A) transmission medium 
B) channel 
C) protocol 
D) modem

Question 16

How many bits are needed for standard encoding if the size of the character set is X?

Accepted Answer

A) log x 
B) x+1 
C) 2x 
D) x2 
A) log x 
B) x+1 
C) 2x 
D) x2

Question 17

Which are uniquely decodable codes?

Accepted Answer

A) fixed length codes 
B) variable length codes 
C) fixed & variable length codes 
D) none of the mentioned 
A) fixed length codes 
B) variable length codes 
C) fixed & variable length codes 
D) none of the mentioned

Question 18

A function f(x) is even, when?

Accepted Answer

A) f(x) = -f(x) 
B) f(x) = f(-x) 
C) f(x) = -f(x)f(-x) 
D) f(x) = f(x)f(-x) 
A) f(x) = -f(x) 
B) f(x) = f(-x) 
C) f(x) = -f(x)f(-x) 
D) f(x) = f(x)f(-x)

Question 19

Which parameter is called as Shannon limit?

Accepted Answer

A) pb/n0 
B) eb/n0 
C) ebn0 
D) none of the mentioned 
A) pb/n0 
B) eb/n0 
C) ebn0 
D) none of the mentioned

Question 20

From the following given tree, what is the code word for the character 'a'?

Accepted Answer

A) 011 
B) 010 
C) 100 
D) 101 
A) 011 
B) 010 
C) 100 
D) 101

The code length does not depend on the frequency of occurrence of characters.

What is the advantage of superheterodyning?

Which achieves greater compression?

Which bit is reserved as a parity bit in an ASCII set?

Which of the following algorithms is the best approach for solving Huffman codes?

Equivocation is the

Notch is a_________

Mutual information should be

Sin wave is_________

Lempel-Ziv algorithm is

ASCII code is a

Which is easier to implement and is preferred?

The type of encoding where no character code is the prefix of another character code is called?

What will be the cost of the code if character ci is at depth di and occurs at frequency fi?

Agreement between communication devices are called_________

How many bits are needed for standard encoding if the size of the character set is X?

Which are uniquely decodable codes?

A function f(x) is even, when?

Which parameter is called as Shannon limit?

From the following given tree, what is the code word for the character 'a'?

Modulation and Demodulation Techniques

Information Theory and Communication Techniques

Waveform Logic, Pcm Encoding, Vocoder Analysis, and Antenna Radiations

Microwave Communication and Modulation

M-Ary Signalling and Pulse Shaping Techniques

Signal Filtering and Equalization Techniques

Channel Coding and Error Correction Techniques

Algorithms and Techniques for Communication System Security and Error Correction

Modulation Schemes and Access Techniques for Spread Spectrum Systems

Digital and Analog Telecommunications Standards

Filters

Exam 7: Information Theory and Coding Techniques

The code length does not depend on the frequency of occurrence of characters.

What is the advantage of superheterodyning?

Which achieves greater compression?

Which bit is reserved as a parity bit in an ASCII set?

Which of the following algorithms is the best approach for solving Huffman codes?

Equivocation is the

Notch is a_________

Mutual information should be

Sin wave is_________

Lempel-Ziv algorithm is

ASCII code is a

Which is easier to implement and is preferred?

The type of encoding where no character code is the prefix of another character code is called?

What will be the cost of the code if character ci is at depth di and occurs at frequency fi?

Agreement between communication devices are called_________

How many bits are needed for standard encoding if the size of the character set is X?

Which are uniquely decodable codes?

A function f(x) is even, when?

Which parameter is called as Shannon limit?

From the following given tree, what is the code word for the character 'a'?

Modulation and Demodulation Techniques

Information Theory and Communication Techniques

Waveform Logic, Pcm Encoding, Vocoder Analysis, and Antenna Radiations

Microwave Communication and Modulation

M-Ary Signalling and Pulse Shaping Techniques

Signal Filtering and Equalization Techniques

Channel Coding and Error Correction Techniques

Algorithms and Techniques for Communication System Security and Error Correction

Modulation Schemes and Access Techniques for Spread Spectrum Systems

Digital and Analog Telecommunications Standards

Filters