A source code whose average word length approaches the fundamental limit set by the entropy of a discrete memoryless source. A. Prefix code B. Huffman code C. Entropy code D. Source code

A source code whose average word length approaches the fundamental limit set by the
entropy of a discrete memoryless source.
A. Prefix code
B. Huffman code
C. Entropy code
D. Source code
by

1 Answer

Answer :

B. Huffman code
by

Related questions

Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I(x;y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel?

Description : Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty ... (H(x) - H(x|y))]  p(x) (D) max H(x|y)  p(x)

Last Answer : (D) max H(x|y)   p(x)

Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Description : Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information? (A) 2 bits per symbol (B) 1.75 bits per symbol (C) 1.50 bits per symbol (D) 1.25 bits per symbol

Last Answer : (B) 1.75 bits per symbol

Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Description : Average length of Extended Huffman code is upper bounded by : a. R b. R+1 c. R-1 d. R+1/n

Last Answer : d. R+1/n

The rate for a discrete source is simply the______. a. Entropy b. Loss c. Noise d. Distortion

Description : The rate for a discrete source is simply the______. a. Entropy b. Loss c. Noise d. Distortion

Last Answer : a. Entropy

A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table: using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Description : A data file of 1,00,000 characters contains only the characters g-l, with the frequencies as indicated in table:  using the variable-length code by Huffman codes, the file can be encoded with (A) 2,52,000 bits (B) 2,64,000 bits (C) 2,46,000 bits (D) 2,24,000 bits

Last Answer : (D) 2,24,000 bits 

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is A. 8.0 bit B. 2.0 bit C. 1.9 bit D. 2.1 bit

Last Answer : C. 1.9 bit

A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Description : A Huffman code: A = 1, B = 000, C = 001, D = 01 ,P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is a. 8.0 bit b. 2.0 bit c. 1.9 bit d. 2.1 bit

Last Answer : c. 1.9 bit

Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Description : Given the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30, 2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in bits per symbol is: (A) 67/30 (B) 70/34 (C) 76/30 (D) 78/30

Last Answer : (C) 76/30

A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Description : A Huffman encoder takes a set of characters with fixed length and produces a set of characters of A. fixed length B. constant length C. random length D. variable length

Last Answer : D. variable length

Combination of modulator, channel and detector. A. Transceiver B. Discrete channel C. T/R channel D. Transponder

Description : Combination of modulator, channel and detector. A. Transceiver B. Discrete channel C. T/R channel D. Transponder

Last Answer : B. Discrete channel

Mention the advantages of integrated circuits over discrete components.

Description : Mention the advantages of integrated circuits over discrete components.

Last Answer : *Miniaturisation and hence increased equipment density. *Cost reduction due to batch processing. *Increased system reliability due to the elimination of soldered joints. *Improved functional performance. *Matched devices. *Increased operating speeds. *Reduction in power consumption.

As temperature goes to “0”, the entropy approaches a constant  a. Zeroth Law of Thermodynamics  b. First Law of Thermodynamics  c. Second Law of Thermodynamics  d. Third Law of Thermodynamics

Description : As temperature goes to “0”, the entropy approaches a constant  a. Zeroth Law of Thermodynamics  b. First Law of Thermodynamics  c. Second Law of Thermodynamics  d. Third Law of Thermodynamics

Last Answer : Third Law of Thermodynamics

In Huffman encoding, both the sender and receiver must have a copy of the code a. Same b. Different c. Generate on Demand d. Both (a) and (b)

Description : In Huffman encoding, both the sender and receiver must have a copy of the code a. Same b. Different c. Generate on Demand d. Both (a) and (b)

Last Answer : a. Same

Compression method use for Integer type data a. Huffman b. LZ77 c. Golomb Code d. Adaptive Huffman

Description : Compression method use for Integer type data a. Huffman b. LZ77 c. Golomb Code d. Adaptive Huffman

Last Answer : c. Golomb Code

An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is a. A = 01 B = 111 C = 110 D = 10 b. A = 0, B = 100, C = 101, D = 11

Description : An alphabet consist of the letters A, B, C and D. The probability of occurrence is P(A) = 0.4, P(B) = 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman code is a. A = 01 B = 111 C = 110 D = 10 b. A = 0, B = 100, C = 101, D = 11

Last Answer : b. A = 0, B = 100, C = 101, D = 11

ASCII Code is a example of a. Prefix code b. Variable length code c. Fixed length code d. Alphanumeric code

Description : ASCII Code is a example of a. Prefix code b. Variable length code c. Fixed length code d. Alphanumeric code

Last Answer : c. Fixed length code

ECE Board Exam March 1996 What is the purpose of a beat frequency oscillator (BFO)? A. Aid in the reception of weak voice-modulated signals B. Generates a signal, whose frequency is the same as that of the intermediate frequency C. Generates a 1kHz note for Morse code reception D. Generates an output, whose frequency differs from that of the intermediate frequency by 1 kHz

Description : ECE Board Exam March 1996 What is the purpose of a beat frequency oscillator (BFO)? A. Aid in the reception of weak voice-modulated signals B. Generates a signal, whose frequency is the ... reception D. Generates an output, whose frequency differs from that of the intermediate frequency by 1 kHz

Last Answer : C. Generates a 1kHz note for Morse code reception

A noise whose source is within the solar system. A. Solar noise B. Thermal noise C. Cosmic noise D. Johnson Noise

Description : A noise whose source is within the solar system. A. Solar noise B. Thermal noise C. Cosmic noise D. Johnson Noise

Last Answer : A. Solar noise

The fundamental approaches to build a point - to - point network is: a) Circuit Switching b) Packet Switching c) Both of Above d) None of These

Description : The fundamental approaches to build a point - to - point network is: a) Circuit Switching b) Packet Switching c) Both of Above d) None of These

Last Answer : c) Both of Above

_____ is the amount of uncertainty in a system of symbols A. Bandwidth B. Enthalpy C. Entropy D. Quantum

Description : _____ is the amount of uncertainty in a system of symbols A. Bandwidth B. Enthalpy C. Entropy D. Quantum

Last Answer : C. Entropy

Entropy of a source is a. Self information of the source b. Average self information c. Average number of bits d. Both (a) and (b)

Description : Entropy of a source is a. Self information of the source b. Average self information c. Average number of bits d. Both (a) and (b)

Last Answer : b. Average self information

The connecting rod bolts are tightened up so that the initial tightening stress (A) Approaches yield point (B) Approaches endurance limit (C) Approaches (yield point stress/factor of safety) (D) Approaches (endurance limit stress/factor of safety)

Description : The connecting rod bolts are tightened up so that the initial tightening stress (A) Approaches yield point (B) Approaches endurance limit (C) Approaches (yield point stress/factor of safety) (D) Approaches (endurance limit stress/factor of safety)

Last Answer : (A) Approaches yield point

Which is the proper measurement of average power emitted by a pulsed laser? a. Energy x time b. Pulse energy x repetition rate c. Pulse energy / repetition rate d. Peak power x pulse length

Description : Which is the proper measurement of average power emitted by a pulsed laser? a. Energy x time b. Pulse energy x repetition rate c. Pulse energy / repetition rate d. Peak power x pulse length

Last Answer : b. Pulse energy x repetition rate

The lowest frequency produced by an instrument. A. Harmonic B. Fundamental C. Midrange D. 0 Hz

Description : The lowest frequency produced by an instrument. A. Harmonic B. Fundamental C. Midrange D. 0 Hz

Last Answer : B. Fundamental

Lowest frequency produced by a musical instrument. A. Fundamental B. Midrange C. Period D. Harmonic

Description : Lowest frequency produced by a musical instrument. A. Fundamental B. Midrange C. Period D. Harmonic

Last Answer : A. Fundamental

is a symbolic representation of discrete elements of information: a. Data b. Code c. Address d. Control

Description : is a symbolic representation of discrete elements of information: a. Data b. Code c. Address d. Control

Last Answer : b. Code

How would you describe the sound of a car whose horn is stuck as it approaches then passes you?

Description : How would you describe the sound of a car whose horn is stuck as it approaches then passes you?

Last Answer : Need answer

The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Description : The values of the set membership is represented by ___________ a) Discrete Set b) Degree of truth c) Probabilities d) Both Degree of truth & Probabilities

Last Answer : b) Degree of truth

Membership function defines the fuzziness in a fuzzy set irrespective of the elements in the set, which are discrete or continuous. A. True B. False

Description : Membership function defines the fuzziness in a fuzzy set irrespective of the elements in the set, which are discrete or continuous. A. True B. False

Last Answer : B. False

The values of the set membership is represented by a) Discrete Set b) Degree of truth c) Probabilities d) Both b & c

Description : The values of the set membership is represented by a) Discrete Set b) Degree of truth c) Probabilities d) Both b & c

Last Answer : b) Degree of truth

The total noise power present in a 1-Hz bandwidth . A. Noise density B. Noise figure C. Noise limit D. Noise intensity

Description : The total noise power present in a 1-Hz bandwidth . A. Noise density B. Noise figure C. Noise limit D. Noise intensity

Last Answer : A. Noise density

What theorem sets a limit on the maximum capacity of a channel with a given noise level? A. Nyquist theorem B. Hartley law C. Shannon-Hartley theorem D. Shannon theorem

Description : What theorem sets a limit on the maximum capacity of a channel with a given noise level? A. Nyquist theorem B. Hartley law C. Shannon-Hartley theorem D. Shannon theorem

Last Answer : C. Shannon-Hartley theorem

For a loudness level between 110 and 120 dB, the maximum daily exposure limit is ____ minute (s). A. 1 B. 60 C. 20 D. 45

Description : For a loudness level between 110 and 120 dB, the maximum daily exposure limit is ____ minute (s). A. 1 B. 60 C. 20 D. 45

Last Answer : A. 1

Assume a frequency range of 405.0125 MHz to 405.0875 MHz and 25 kHz channeling plan, determine the center frequency of the second channel from the lower limit. A. 405.030 MHz B. 405.025 MHz C. 405.050 MHz D. 405.075 MHz

Description : Assume a frequency range of 405.0125 MHz to 405.0875 MHz and 25 kHz channeling plan, determine the center frequency of the second channel from the lower limit. A. 405.030 MHz B. 405.025 MHz C. 405.050 MHz D. 405.075 MHz

Last Answer : C. 405.050 MHz

Assume a frequency range of 401.000 MHz to 401.050 MHz, if you apply 25 kHz channeling plan, determine the center frequency of the first channel from the lower limit. A. 401.010 MHz B. 401.0125 MHz C. 401.025 MHz D. 401.00625 MHz

Description : Assume a frequency range of 401.000 MHz to 401.050 MHz, if you apply 25 kHz channeling plan, determine the center frequency of the first channel from the lower limit. A. 401.010 MHz B. 401.0125 MHz C. 401.025 MHz D. 401.00625 MHz

Last Answer : B. 401.0125 MHz

If frequency range of 401.000MHz to 401.050MHz has to be channelized at 12.5 kHz between channel, what is the center of its first channel from the lower limit? A. 401.125MHz B. 401.00625MHz C. 401.025MHz D. 401.0125MHz

Description : If frequency range of 401.000MHz to 401.050MHz has to be channelized at 12.5 kHz between channel, what is the center of its first channel from the lower limit? A. 401.125MHz B. 401.00625MHz C. 401.025MHz D. 401.0125MHz

Last Answer : B. 401.00625MHz

______ sets the limit on the maximum capacity of a channel with a given noise level. A. Hartley theorem B. Shannon-hartley theorem C. Nyquist theorem D. Shannon theorem

Description : ______ sets the limit on the maximum capacity of a channel with a given noise level. A. Hartley theorem B. Shannon-hartley theorem C. Nyquist theorem D. Shannon theorem

Last Answer : B. Shannon-hartley theorem

________ sets a limit on the maximum capacity of a channel with a give noise level. A. Hartley theorem B. Shannon-Hartley theorem C. Nyquist theorem D. Shannon theorem

Description : ________ sets a limit on the maximum capacity of a channel with a give noise level. A. Hartley theorem B. Shannon-Hartley theorem C. Nyquist theorem D. Shannon theorem

Last Answer : B. Shannon-Hartley theorem

As a source of sound approaches a stationary listener, the apparent wavelength: w) increases x) decreases y) stays the same.

Description : As a source of sound approaches a stationary listener, the apparent wavelength: w) increases x) decreases y) stays the same. 

Last Answer : ANSWER: X -- DECREASES

Code {0,10,100,111} is : a. UDC b. Prefix code c. Instantaneous code d. All above

Description : Code {0,10,100,111} is : a. UDC b. Prefix code c. Instantaneous code d. All above

Last Answer : d. All above

A temperature scale whose zero point is absolute zero, the temperature of “0” entropy at which all molecular motion stops.  a. Celsius  b. Fahrenheit  c. Kelvin  d. Rankine

Description : A temperature scale whose zero point is absolute zero, the temperature of “0” entropy at which all molecular motion stops.  a. Celsius  b. Fahrenheit  c. Kelvin  d. Rankine

Last Answer : Kelvin

Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2

Description : Total number of nodes in the adaptive huffman tree is: A. 2n+1 B. 2n C. 2n-1 D. 2n-2

Last Answer : C. 2n-1

Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Description : Which formula shows how to work out the percentage a file has been compressed by? A. bits in (Huffman *7) /100 B. bits in ASCii - bits in Huffman C. difference in bits / bits in ASCII * 100

Last Answer : C. difference in bits / bits in ASCII * 100

How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Description : How do you calculate the number of bits of a body of text in ASCII? A. Number of characters * 7 B. Number of characters (including spaces) *7 C. bits in Huffman * 7 D. bits in Huffman / 7

Last Answer : B. Number of characters (including spaces) *7

How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right D. 0 = middle 1 = back

Description : How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right D. 0 = middle 1 = back

Last Answer : C. 0 = left 1 = right

Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Description : Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Last Answer : A. Frequency

How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right 0 = middle 1 = back

Description : How do you move through a Huffman tree? A. 0 = right 1= left B. 1 = left 2 = right C. 0 = left 1 = right 0 = middle 1 = back

Last Answer : C. 0 = left 1 = right

Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Description : Huffman trees use the _______________ of each character to work out their encoding. A. Frequency B. Order in ASCII C. Number value

Last Answer : A. Frequency

Huffman coding is an encoding algorithm used for A. lossless data compression B. files greater than 1 Mbit C. broadband systems D. lossy data compression

Description : Huffman coding is an encoding algorithm used for A. lossless data compression B. files greater than 1 Mbit C. broadband systems D. lossy data compression

Last Answer : A. lossless data compression

The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more frequently occuring characters C. compress data by using more bits to encode more frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Description : The basic idea behind Huffman coding is to A. compress data by using fewer bits to encode fewer frequently occuring characters B. compress data by using fewer bits to encode more ... frequently occuring characters D. expand data by using fewer bits to encode more frequently occuring characters

Last Answer : B. compress data by using fewer bits to encode more frequently occuring characters