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

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
by

1 Answer

Answer :

c. 1.9 bit
by

Related questions

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

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

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

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

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

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

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

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

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

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

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

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

Code {0,01,11,111} is UDC. a. True b. False

Description : Code {0,01,11,111} is UDC. a. True b. False

Last Answer : b. False

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

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 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 trees use the _______________ of each character to work out their encoding. a. Frequency b. Order in ASCII c. Number value d. Both (a) and (b)

Description : Huffman trees use the _______________ of each character to work out their encoding. a. Frequency b. Order in ASCII c. Number value d. Both (a) and (b)

Last Answer : a. Frequency

An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Description : An artist makes an RGB raster image in which each pixel color is encoded with 12-bits --- 4 bits each for red, green and blue.Which of the following correctly shows the hexadecimal value for Red as a 12-bit representation A. F00 B. 00F C. FF00 D. FF0000

Last Answer : D. FF0000

The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Description : The correct encoding of the letter C in this tree is... A. 11 B. 10 C. 01 D. 00

Last Answer : C. 01

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

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

Extended Huffman method is used due to a. Large alphabet b. Skewed probability c. Equal probability d. Both (a) and(b)

Description : Extended Huffman method is used due to a. Large alphabet b. Skewed probability c. Equal probability d. Both (a) and(b)

Last Answer : b. Skewed probability

The UNIX compress command is one of the earlier applications of a. LZ77 b. LZ78 c. Huffman d. LZW

Description : The UNIX compress command is one of the earlier applications of a. LZ77 b. LZ78 c. Huffman d. LZW

Last Answer : d. LZW

If the probability is not given which method is preferable a. Huffman b. Non Binary Huffman c. Adaptive Huffman d. Extended Huffman

Description : If the probability is not given which method is preferable a. Huffman b. Non Binary Huffman c. Adaptive Huffman d. Extended Huffman

Last Answer : c. Adaptive Huffman

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

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 

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

Define the term 'sample rate'. A. Snapshots of sound are taken as the wave cannot be represented as a series of continuous changes. B. The number of samples taken each second C. The number of bits used per second of audio D. The number of bits available for each clip

Description : Define the term 'sample rate'. A. Snapshots of sound are taken as the wave cannot be represented as a series of continuous changes. B. The number of samples taken each second C. The number of bits used per second of audio D. The number of bits available for each clip

Last Answer : B. The number of samples taken each second

An Image is represented by 65536 X8 bits, and after compression it reduced to 16384 X8 bits. What will be the compression ratio: a. 55% b. 65% c. 75% d. 85%

Description : An Image is represented by 65536 X8 bits, and after compression it reduced to 16384 X8 bits. What will be the compression ratio: a. 55% b. 65% c. 75% d. 85%

Last Answer : c. 75%

How many colours can be used for each pixel if the colour depth is 4 bit? A. 4 colours B. 5 colours C. 15 colours D. 16 colours

Description : How many colours can be used for each pixel if the colour depth is 4 bit? A. 4 colours B. 5 colours C. 15 colours D. 16 colours

Last Answer : D. 16 colours

What is colour/bit depth of the image? A. 1 B. 2 C. 3 D. 4

Description : What is colour/bit depth of the image? A. 1 B. 2 C. 3 D. 4

Last Answer : A. 1

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 base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Description : A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Last Answer : A. Binary

Approximately how much bigger (how many more bytes) is a megabyte than a kilobyte? A. 1000 times bigger B. 10,0000 times bigger C. 1,000,000,000 times bigger D. 100,000 times bigger

Description : Approximately how much bigger (how many more bytes) is a megabyte than a kilobyte? A. 1000 times bigger B. 10,0000 times bigger C. 1,000,000,000 times bigger D. 100,000 times bigger

Last Answer : D. 100,000 times bigger

Convert 1001 into decimal? A. 8 B. 11 C. 12 D. 9

Description : Convert 1001 into decimal? A. 8 B. 11 C. 12 D. 9

Last Answer : D. 9

Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Description : Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Last Answer : b. 1.22

Gross assets are Rs.1,01,000, fictitious assets Rs.350 are included in the gross assets. External liabilities are Rs.7,500. 6% prefer share capital is Rs.45,000. Equity capital is 4,500 equity shares of Rs.10 each fully paid. Average expected profit is Rs.8,500. Transfer to reserves is 10%. Pref. dividend is payable. NRR is 9%. The Net Asset Value Per share is A Rs.11 B Rs.10.70 C Rs.15 D Rs.20s

Description : Gross assets are Rs.1,01,000, fictitious assets Rs.350 are included in the gross assets. External liabilities are Rs.7,500. 6% prefer share capital is Rs.45,000. Equity capital is 4,500 equity shares of Rs.10 each fully ... . The Net Asset Value Per share is A Rs.11 B Rs.10.70 C Rs.15 D Rs.20

Last Answer : Rs.10.70

What is the reason that in the beginning of encoded file there is data telling which digit/letter represents which word ? a) It is needed to convert the file in compression form b) it is needed to convert the file in encoded form c) it is needed to convert the file in its original uncompressed form d) it is needed to convert the file in graphical form

Description : What is the reason that in the beginning of encoded file there is data telling which digit/letter represents which word ? a) It is needed to convert the file in compression form b) it is ... convert the file in its original uncompressed form d) it is needed to convert the file in graphical form

Last Answer : c) it is needed to convert the file in its original uncompressed form

Where in the encoded file, one can have the data that tells which digit/letter represents which word ? a) Beginning b) Middle c) Ending d) None of these

Description : Where in the encoded file, one can have the data that tells which digit/letter represents which word ? a) Beginning b) Middle c) Ending d) None of these

Last Answer : a) Beginning

In data compression technique, each word is represented by what ? a) Digit b) Letter c) a or b d) Picture

Description : In data compression technique, each word is represented by what ? a) Digit b) Letter c) a or b d) Picture

Last Answer : c) a or b

In the encoded file, which type of changes are made in sysmbols ? a. They are compressed b. They are changed to a letter or symbol c. They are represented in the graphical form d. No changes are made

Description : In the encoded file, which type of changes are made in sysmbols ? a. They are compressed b. They are changed to a letter or symbol c. They are represented in the graphical form d. No changes are made

Last Answer : d. No changes are made

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all

In a number sequence what is 0.001 0.01 0.1 1?

Description : In a number sequence what is 0.001 0.01 0.1 1?

Last Answer : Each successive number is ten times the one before it.

What is the Next number in the sequence 0.001 0.01 0.1 1?

Description : What is the Next number in the sequence 0.001 0.01 0.1 1?

Last Answer : 10

The difference in one unit of Rockwell hardness number corresponds to a difference in the depth of indentation of __________ mm. (A) 0.001 (B) 0.01 (C) 0.002 (D) 0.02

Description : The difference in one unit of Rockwell hardness number corresponds to a difference in the depth of indentation of __________ mm. (A) 0.001 (B) 0.01 (C) 0.002 (D) 0.02

Last Answer : Option C

A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network? a. 2 Mbps b. 60 Mbps c. 120 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network? a. 2 Mbps b. 60 Mbps c. 120 Mbps

Last Answer : a. 2 Mbps

A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Description : A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ? (A) 2 Mbps (B) 60 Mbps (C) 120 Mbps (D) 10 Mbps

Last Answer : (A) 2 Mbps Explanation: In data transmission, throughput is the amount of data moved successfully from one place to another in a given period of time, and typically measured in bits per second (bps), ... second (Mbps) or gigabits per second (Gbps). Here, Throughput = 15000 x 8000/60 = 2 Mbps 

The binary code for each pixel is used to determine A. Which colour will be displayed B. How big the image is C. What shape the image is D. How many pixels will be in the image

Description : The binary code for each pixel is used to determine A. Which colour will be displayed B. How big the image is C. What shape the image is D. How many pixels will be in the image

Last Answer : A. Which colour will be displayed