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

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

1 Answer

Answer :

d. R+1/n
by

Related questions

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

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

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

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

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

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

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

The bounded Quantization error is also called__________. A. overload error B. overload noise C. granular error D. All of above

Description : The bounded Quantization error is also called__________. A. overload error B. overload noise C. granular error D. All of above

Last Answer : C. granular error

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

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

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

Last Answer : B. Huffman code

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

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

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

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 color model uses varying intensities of (R)ed, (G)reen, and (B)lue light are added together in to reproduce a broad array of colors. A. BGR Color B. Primary Color C. Analogous Color D. RGB Color

Description : The color model uses varying intensities of (R)ed, (G)reen, and (B)lue light are added together in to reproduce a broad array of colors. A. BGR Color B. Primary Color C. Analogous Color D. RGB Color

Last Answer : C. Analogous Color

In polar vector quantization r is called ________. a. Quantum b. Phase c. Magnitude d. None of above

Description : In polar vector quantization r is called ________. a. Quantum b. Phase c. Magnitude d. None of above

Last Answer : c. Magnitude

In Tree structures vector quantization cluster is divided in a. 2 groups b. 3 groups c. Infinite groups d. N groups

Description : In Tree structures vector quantization cluster is divided in a. 2 groups b. 3 groups c. Infinite groups d. N groups

Last Answer : a. 2 groups

In an all weld tensile test, the original specimen gauge length was 50mm, and after the test the increased gauge length was 65mm, what is the elongation percentage? a) % A is 40 b) % A is 60 c) % A is 30 d) % A is 36

Description : In an all weld tensile test, the original specimen gauge length was 50mm, and after the test the increased gauge length was 65mm, what is the elongation percentage? a) % A is 40 b) % A is 60 c) % A is 30 d) % A is 36

Last Answer : c) % A is 30

When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Description : When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Last Answer : A. When we want to compress patterns of data

When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Description : When is Run Length Encoding used? A. When we want to compress patterns of data B. When we want to decompress patterns of data C. When we want to encode running videos

Last Answer : A. When we want to compress patterns of data

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

An ________is encoded and the algorithm attempts to use the next smaller context. a. One length context b. Zero context c. Escape symbol d. None

Description : An ________is encoded and the algorithm attempts to use the next smaller context. a. One length context b. Zero context c. Escape symbol d. None

Last Answer : c. Escape symbol

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

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 

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

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

To divide information among cells A. Wrap B. Split C. Lock D. Column

Description : To divide information among cells A. Wrap B. Split C. Lock D. Column

Last Answer : B. Split

To change the font size in order to display more text or other data A. Border B. Shading C. Shrink to fit D. Printing area

Description : To change the font size in order to display more text or other data A. Border B. Shading C. Shrink to fit D. Printing area

Last Answer : A. Border

To make lines of text appear on multiple lines of a cell A. Wrap B. Split C. Lock D. Column

Description : To make lines of text appear on multiple lines of a cell A. Wrap B. Split C. Lock D. Column

Last Answer : D. Column

A webpage is an example of an ........... electronic document A. Comp B. DTP C. On screen D. Online

Description : A webpage is an example of an ........... electronic document A. Comp B. DTP C. On screen D. Online

Last Answer : C. On screen

This document is designed to be viewed ........ on your tablet A. Comp B. DTP C. On screen D. Online

Description : This document is designed to be viewed ........ on your tablet A. Comp B. DTP C. On screen D. Online

Last Answer : A. Comp

A ........ is an initial document that shows where all text and graphic elements will be placed A. Comp B. DTP C. On screen D. Online

Description : A ........ is an initial document that shows where all text and graphic elements will be placed A. Comp B. DTP C. On screen D. Online

Last Answer : C. On screen

What does 'WYSIWYG' stand for? A. Why you see is why you get B. When you see is when you get C. What you see is what you get D. Where you see is where you get

Description : What does 'WYSIWYG' stand for? A. Why you see is why you get B. When you see is when you get C. What you see is what you get D. Where you see is where you get

Last Answer : D. Where you see is where you get

.............. means that a printed document will appear exactly as it does on-screen A. Layout B. Publish C. Clip art D. WYSIWYG

Description : .............. means that a printed document will appear exactly as it does on-screen A. Layout B. Publish C. Clip art D. WYSIWYG

Last Answer : C. Clip art