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

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
by

1 Answer

Answer :

b. A = 0, B = 100, C = 101, D = 11
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

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

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

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

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

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

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

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

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

Run length encoding is a compression method in which repeated ______ of a symbol are replaced. a. Residual b. Occurrence c. Letters d. None

Description : Run length encoding is a compression method in which repeated ______ of a symbol are replaced. a. Residual b. Occurrence c. Letters d. None

Last Answer : b. Occurrence

A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is? a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100

Description : A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is? a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100

Last Answer : c) 000 or 010 or 110 or 100

A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is: a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100 d) 100 or 111 or 101 or 001

Description : A 3-input neuron is trained to output a zero when the input is 110 and a one when the input is 111. After generalization, the output will be zero when and only when the input is: a) 000 or 110 or 011 or 101 b) 010 or 100 or 110 or 101 c) 000 or 010 or 110 or 100 d) 100 or 111 or 101 or 001

Last Answer : c) 000 or 010 or 110 or 100

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

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

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

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

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

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

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 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

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

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

A box contains 15bolts of which 5 are defective. If 5 bolts are selected at random from the box, what is the probability that at least one of them is defective? a) 91/143 b) 101/143 c) 111/143 d) 121/143 e) 131/143

Description : A box contains 15bolts of which 5 are defective. If 5 bolts are selected at random from the box, what is the probability that at least one of them is defective? a) 91/143 b) 101/143 c) 111/143 d) 121/143 e) 131/143

Last Answer : Probability that at least one is defective = 1 – probability that none is defective Probability that none is defective = 10C5 / 15C5 = 12/143 Required Probability = 1-12/143 = 131/143 Answer: e)

If the P(E) = 1, it means event a. does not occur b. always occur c. no probability d. Normalization

Description : If the P(E) = 1, it means event a. does not occur b. always occur c. no probability d. Normalization

Last Answer : b. always occur

Assume postal rates for 'light letters' are: $0.25 up to 10 grams; $0.35 up to 50 grams; $0.45 up to 75 grams; $0.55 up to 100 grams. Which test inputs (in grams) would be selected using boundary value analysis? A. 0, 9,19, 49, 50, 74, 75, 99,100 B. 10, 50, 75,100, 250, 1000 C. 0, 1,10,11, 50, 51, 75, 76,100,101 D. 25, 26, 35, 36, 45, 46, 55, 56

Description : Assume postal rates for 'light letters' are: $0.25 up to 10 grams; $0.35 up to 50 grams; $0.45 up to 75 grams; $0.55 up to 100 grams. Which test inputs (in grams) would be selected using boundary value analysis? A. 0, 9,19, ... C. 0, 1,10,11, 50, 51, 75, 76,100,101 D. 25, 26, 35, 36, 45, 46, 55, 56

Last Answer : C. 0, 1,10,11, 50, 51, 75, 76,100,101

The ratio of spacing (d) for for simple cubic lattice, d(100) :d(110) :d(111) a. 1 : 0.707: 0.669 b. 1: 1.414: 0.577 c. 1: 0.707 : 0.577 d. 1: 0.707 : 1.154

Description : The ratio of spacing (d) for for simple cubic lattice, d(100) :d(110) :d(111) a. 1 : 0.707: 0.669 b. 1: 1.414: 0.577 c. 1: 0.707 : 0.577 d. 1: 0.707 : 1.154

Last Answer : c. 1: 0.707 : 0.577

Probability model is based on a. Probability b. Physics c. Frequency d. None

Description : Probability model is based on a. Probability b. Physics c. Frequency d. None

Last Answer : c. Frequency

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

Description : 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

Last Answer : a. Static Dictionary

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

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

An octal number 237 is equal to the binary number 1) 010 011 111 2) 010 111 011 3) 011 101 101 4) 011 000 001

Description : An octal number 237 is equal to the binary number 1) 010 011 111 2) 010 111 011 3) 011 101 101 4) 011 000 001

Last Answer : 3) 011 101 101

A key-board has at least: (A) 91 keys (B) 101 keys (C) 111 keys (D) 121 keys

Description : A key-board has at least: (A) 91 keys (B) 101 keys (C) 111 keys (D) 121 keys

Last Answer : (B) 101 keys

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

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

The distance of the pointer from the look-ahead buffer is called : a. Length b. Offset c. Triplet d. Code

Description : The distance of the pointer from the look-ahead buffer is called : a. Length b. Offset c. Triplet d. Code

Last Answer : b. Offset

Sequence of code assigned is called a. A. code word b. B. word c. C. byte d. D. nibble

Description : Sequence of code assigned is called a. A. code word b. B. word c. C. byte d. D. nibble

Last Answer : a. A. code word

The definition of Money bill is provided in which article of the Indian Constitution- a) Article 10 b) Article -19 c) Article 110 d)Article-111

Description : The definition of Money bill is provided in which article of the Indian Constitution- a) Article 10 b) Article -19 c) Article 110 d)Article-111

Last Answer : c) Article 110

Money bill has been defined in - (1) (1) Article 110 (2) (2) Article 111 (3) Article 112 (4) Artcle 113

Description : Money bill has been defined in - (1) (1) Article 110 (2) (2) Article 111 (3) Article 112 (4) Artcle 113

Last Answer : (1) Article 110 Explanation: Article 110 - definition of money bills Article 111 - Assent to Bills Article 112 - Annual financial statement Article 113 - Procedure in Parliament with respect to estimates

In which article of the Indian constitution explained the Money Bill? (i) Article 109 (ii) Article 110 (iii) Article 111 (iv) None of the above

Description : In which article of the Indian constitution explained the Money Bill? (i) Article 109 (ii) Article 110 (iii) Article 111 (iv) None of the above

Last Answer : (i) Article 109

19/14 x 12/72 x 18/29 x 767 = ? (Take 2 digits after the decimal point) a) 110.69 b) 118.78 c) 111.56 d) None e) 108.98

Description : 19/14 x 12/72 x 18/29 x 767 = ? (Take 2 digits after the decimal point) a) 110.69 b) 118.78 c) 111.56 d) None e) 108.98

Last Answer : 19/14 x 12/72 x 18/29 x 767 =? Sol: 1.35 x 0.16 x 0.62 x 767 = ? 102.71 = ? Answer: d)

3, 5, 9, 15, 25, 41 , 67, ? (a) 108 (b) 52 (c) 110 (d) 111

Description : 3, 5, 9, 15, 25, 41 , 67, ? (a) 108 (b) 52 (c) 110 (d) 111

Last Answer : The difference between the number in this series is the sum of two previous differences .

You are stuck in a room. On the door is a keypad with all the letters of the alphabet and the enter button. The word is 7 letters long. To your left, is a table with a note. The note reads: Sulfer Carbon Iodine Einsteinium Nitrogen Cerium On the other side of the room is a billboard. On the billboard there is a note pinned to it. On this note, it says: After solving the note upon the table, remove a letter and you will be free.” What is the code to escape? -Riddles

Description : You are stuck in a room. On the door is a keypad with all the letters of the alphabet and the enter button. The word is 7 letters long. To your left, is a table with a note. The note reads: ... the note upon the table, remove a letter and you will be free. What is the code to escape? -Riddles

Last Answer : The code is science After solving for the first note, you will get sciesnce. If you don't understand why, go to the Periodic Table of the Elements and find these elements there. From the ... with this my self when I was looking at the periodic table. Thank you for reading my Escape Room.

Why do computers use binary? A. Because It's all the understand.... B. Because a computer is a series of switches, 1 being on and 0 being off C. Because they can't understand ASCII D. Because UNICODE doesn't work

Description : Why do computers use binary? A. Because It's all the understand.... B. Because a computer is a series of switches, 1 being on and 0 being off C. Because they can't understand ASCII D. Because UNICODE doesn't work

Last Answer : A. Because It's all the understand....