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

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
by

1 Answer

Answer :

A. lossless data compression
by

Related questions

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

Which of the following is a benefit of lossy compression over lossless? A. File sizes will always be reduced, even when compressed multiple times. B. File quality is not harmed, e.g. images will look exactly the same. C. Files can be decompressed back to their original uncompressed form. D. File sizes are usually significantly smaller.

Description : Which of the following is a benefit of lossy compression over lossless? A. File sizes will always be reduced, even when compressed multiple times. B. File quality is not harmed, e.g. ... can be decompressed back to their original uncompressed form. D. File sizes are usually significantly smaller.

Last Answer : C. Files can be decompressed back to their original uncompressed form.

Which best describes Lossless Compression? A. No information is lost but file size is increased B. There is no loss in information at all after compression C. Files which have the exact same data after compression D. Compression that involves an algorithm

Description : Which best describes Lossless Compression? A. No information is lost but file size is increased B. There is no loss in information at all after compression C. Files which have the exact same data after compression D. Compression that involves an algorithm

Last Answer : B. There is no loss in information at all after compression

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

What type of compression actually deletes data and cannot be decompressed? A. File Compression B. Lossless Compression C. Lossy Compression D. Archive Compression

Description : What type of compression actually deletes data and cannot be decompressed? A. File Compression B. Lossless Compression C. Lossy Compression D. Archive Compression

Last Answer : D. Archive Compression

Dennis has saved a photograph and has lost data during compression. What type of compression has occurred? A. LOSSY B. LOSSLESS C. RESOLUTION D. COLOR MODE

Description : Dennis has saved a photograph and has lost data during compression. What type of compression has occurred? A. LOSSY B. LOSSLESS C. RESOLUTION D. COLOR MODE

Last Answer : A. LOSSY

Lossy or lossless? This type of compression does not get rid of any data A. Lossy B. Lossless

Description : Lossy or lossless? This type of compression does not get rid of any data A. Lossy B. Lossless

Last Answer : B. Lossless

Lossy or lossless? This type of compression makes the file smaller A. Lossy B. Lossless

Description : Lossy or lossless? This type of compression makes the file smaller A. Lossy B. Lossless

Last Answer : A. Lossy

How does lossy compression reduce the size of files? A. Through removing redundancies by grouping repeated data together. B. By removing some precision in data that humans would have difficulty to perceive. C. By grouping files into a single folder, thus reducing the amount of storage needed. D. By replacing blocks of data with more compact representations.

Description : How does lossy compression reduce the size of files? A. Through removing redundancies by grouping repeated data together. B. By removing some precision in data that humans would have difficulty to ... the amount of storage needed. D. By replacing blocks of data with more compact representations.

Last Answer : D. By replacing blocks of data with more compact representations.

Which of the following is a true statement about data compression? A. Data compression techniques can be used to reduce the size of a file for storage or transmission. B. Data compression techniques can only be used for certain types of data. C. Data compression techniques cannot be applied to files being transmitted over the Internet. D. Lossy data compression should be used if there may be a need to recover all of the original data from the compressed file.

Description : Which of the following is a true statement about data compression? A. Data compression techniques can be used to reduce the size of a file for storage or transmission. B. Data compression techniques can ... used if there may be a need to recover all of the original data from the compressed file.

Last Answer : A. Data compression techniques can be used to reduce the size of a file for storage or transmission.

Represents one dot that is illuminated on a computer screen, many of which make up images A. Graphics B. Lossless C. Lossy D. Pixels

Description : Represents one dot that is illuminated on a computer screen, many of which make up images A. Graphics B. Lossless C. Lossy D. Pixels

Last Answer : D. Pixels

Anything on a page that is not actual text, from simple line drawings to fully active images found on the World Wide Web. A. Graphics B. Lossless C. Lossy D. Pixels

Description : Anything on a page that is not actual text, from simple line drawings to fully active images found on the World Wide Web. A. Graphics B. Lossless C. Lossy D. Pixels

Last Answer : A. Graphics

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

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

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

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

To save file space lossy compression... A. Temporarily removes data B. Permanently removes data

Description : To save file space lossy compression... A. Temporarily removes data B. Permanently removes data

Last Answer : A. Temporarily removes data

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

What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Description : What process is done by the data compression while encoding the data ? a) Identifying repetition in the data b) Reducing repetition in the data c) Eliminating repetition in the data d) All of these

Last Answer : d) All of these

Performance measure for Lossless Compression is __________: A. Distortion B. Fidelity C. Quality D. Rate

Description : Performance measure for Lossless Compression is __________: A. Distortion B. Fidelity C. Quality D. Rate

Last Answer : D. Rate

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

Hamzah needs to email a large file to a classmate. Why might he need to use file compression to do so? A. Email services often only let you send compressed data files. B. Compressed files are less likely to become corrupted when being transferred via email. C. He won't need to. All email providers let you send any files you like, regardless of size. D. Email services often have maximum file sizes that prevent you sending files that are too large.

Description : Hamzah needs to email a large file to a classmate. Why might he need to use file compression to do so? A. Email services often only let you send compressed data files. B. Compressed files are ... . D. Email services often have maximum file sizes that prevent you sending files that are too large.

Last Answer : D. Email services often have maximum file sizes that prevent you sending files that are too large.

The techniques for reducing the storage requirement of computer files and directory structure are known by which name ? a) Data compression b) Data storage place c) Data form d) Data transfer

Description : The techniques for reducing the storage requirement of computer files and directory structure are known by which name ? a) Data compression b) Data storage place c) Data form d) Data transfer

Last Answer : a) Data compression

Sliding windowing technique is used in which dictionary compression a. LZW b. LZ77 c. LZ78 d. Diagram coding

Description : Sliding windowing technique is used in which dictionary compression a. LZW b. LZ77 c. LZ78 d. Diagram coding

Last Answer : b. LZ77

The reconstruction of a ________constructed sequence is identical to the original sequence. a. losslessly b. lossy c. Predictive d. None of the above

Description : The reconstruction of a ________constructed sequence is identical to the original sequence. a. losslessly b. lossy c. Predictive d. None of the above

Last Answer : a. losslessly

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

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

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

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

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

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

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

Which of the following is not a lossy compression technique ? (A) JPEG (B) MPEG (C) FFT (D) Arithmetic coding

Description : Which of the following is not a lossy compression technique ? (A) JPEG (B) MPEG (C) FFT (D) Arithmetic coding

Last Answer : (D) Arithmetic coding

To convert multimedia information coming from hardware devices into computer data can be compared with which process ? a) Coding b) Decoding c) (a) and (b) both d) None of these

Description : To convert multimedia information coming from hardware devices into computer data can be compared with which process ? a) Coding b) Decoding c) (a) and (b) both d) None of these

Last Answer : a) Coding

Fax is: A. Facsimile Decoding B. Facsimile Encoding C. Factual Encoding. D. Factual Decoding

Description : Fax is: A. Facsimile Decoding B. Facsimile Encoding C. Factual Encoding. D. Factual Decoding

Last Answer : B. Facsimile Encoding

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

___________has become quite popular for encoding all kinds of images, both computer-generated and “natural” images. a. GIF b. PNG c. TIFF d. JPEG

Description : ___________has become quite popular for encoding all kinds of images, both computer-generated and “natural” images. a. GIF b. PNG c. TIFF d. JPEG

Last Answer : a. GIF

Which of these terms is a type of data compression? A. resolution B. zipping C. Inputting D. caching

Description : Which of these terms is a type of data compression? A. resolution B. zipping C. Inputting D. caching

Last Answer : B. zipping