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

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
by

1 Answer

Answer :

D. variable length
by

Related questions

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

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

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

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

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

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

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

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

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

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

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

At any given time, the output of an encoder depends on ______ a. Past input b. Present input c. Both a and b d. None of the above

Description : At any given time, the output of an encoder depends on ______ a. Past input b. Present input c. Both a and b d. None of the above

Last Answer : b. Present input

How many character an encoder reads and searches the dictionary to see if this input exists in the dictionary. a. 2 character b. 1 character c. 3 character d. Both (a) and (b)

Description : How many character an encoder reads and searches the dictionary to see if this input exists in the dictionary. a. 2 character b. 1 character c. 3 character d. Both (a) and (b)

Last Answer : a. 2 character

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 variable is A. DIM B. Console.Writeline("") C. A uniquely named storage location D. a way of holding a WHOLE number

Description : A variable is A. DIM B. Console.Writeline("") C. A uniquely named storage location D. a way of holding a WHOLE number

Last Answer : C. A uniquely named storage location

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

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 programmer is writing a system that is intended to be able to store large amounts of personal data. As the programmer develops the data system, which of the following is LEAST likely to impact the programmer’s choices in designing the structure of the system? A. Maintaining privacy of the information stored in the data set. B. Scalability of the system. C. Structuring the metadata of the information for analysis. D. The frequency of a particular item occurring in a data set.

Description : A programmer is writing a system that is intended to be able to store large amounts of personal data. As the programmer develops the data system, which of the following is LEAST likely to impact the ... of the information for analysis. D. The frequency of a particular item occurring in a data set.

Last Answer : D. The frequency of a particular item occurring in a data set.

The process of representing a large—possibly infinite—set of values with a much smaller set is called______________. A. Linear function Quantization B. PDF. C. CDF D. Quantization

Description : The process of representing a large—possibly infinite—set of values with a much smaller set is called______________. A. Linear function Quantization B. PDF. C. CDF D. Quantization

Last Answer : D. Quantization

Set of L-dimensional blocks called the _______of the vector quantizer. a. Group b. Codebook c. Coding d. Index

Description : Set of L-dimensional blocks called the _______of the vector quantizer. a. Group b. Codebook c. Coding d. Index

Last Answer : b. Codebook

The process of representing Infinite set of values with a much smaller set is called a. Mapping b. clustering c. Quantization d. Sampling

Description : The process of representing Infinite set of values with a much smaller set is called a. Mapping b. clustering c. Quantization d. Sampling

Last Answer : c. Quantization

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

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

A particular way of coding information for storage in a computer file A. Raster graphic B. Vector graphic C. File format D. Layer

Description : A particular way of coding information for storage in a computer file A. Raster graphic B. Vector graphic C. File format D. Layer

Last Answer : A. Raster graphic

Data compression which guarantees that all original data can be restored exactly A. Lossless compression B. Lossy compression C. File compression D. Raster compression

Description : Data compression which guarantees that all original data can be restored exactly A. Lossless compression B. Lossy compression C. File compression D. Raster compression

Last Answer : B. Lossy compression

Which of these is NOT a way to decrease image blurriness? A. Use compatible file formats B. Increase the size of thumbails C. Save images using loseless compression D. Check if raster or vector graphics work better

Description : Which of these is NOT a way to decrease image blurriness? A. Use compatible file formats B. Increase the size of thumbails C. Save images using loseless compression D. Check if raster or vector graphics work better

Last Answer : A. Use compatible file formats

A program allows a user to design and publish a document using only a computer and a printer A. DTP B. PDF C. PPT D. DOC

Description : A program allows a user to design and publish a document using only a computer and a printer A. DTP B. PDF C. PPT D. DOC

Last Answer : A. DTP