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

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
by

1 Answer

Answer :

b. compress data by using fewer bits to encode more frequently occuring  characters
by

Related questions

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

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

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

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

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

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

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 are the main reasons to compress data? A. To reduce secondary storage space B. To maximise the available RAM memory C. To speed up network transmission times D. To optimise the data

Description : What are the main reasons to compress data? A. To reduce secondary storage space B. To maximise the available RAM memory C. To speed up network transmission times D. To optimise the data

Last Answer : A. To reduce secondary storage space

What is compression? A. To convert one file to another B. To reduce the size of data to save space C. To minimize the time taken for a file to be downloaded D. To compress something by pressing it very hard

Description : What is compression? A. To convert one file to another B. To reduce the size of data to save space C. To minimize the time taken for a file to be downloaded D. To compress something by pressing it very hard

Last Answer : B. To reduce the size of data to save space

What is compression? a. To convert one file to another b. To reduce the size of data to save space c. To minimize the time taken for a file to be downloaded d. To compress something by pressing it very hard

Description : What is compression? a. To convert one file to another b. To reduce the size of data to save space c. To minimize the time taken for a file to be downloaded d. To compress something by pressing it very hard

Last Answer : b. To reduce the size of data to save space

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 

It is used to encode the minimum amount of speech information necessary to reproduce a perceptible message with a fewer bits that those needed by a conventional encoder/decoder

Description : It is used to encode the minimum amount of speech information necessary to reproduce a perceptible message with a fewer bits that those needed by a conventional encoder/decoder

Last Answer : vocoders

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

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

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

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

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

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

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

The idea with wavelets is to represent a complicated function by A. sinus functions B. simple basic functions C. lines D. square functions

Description : The idea with wavelets is to represent a complicated function by A. sinus functions B. simple basic functions C. lines D. square functions

Last Answer : B. simple basic functions

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

In the multimedia contents, coding and decoding is performed by a software component known as _______. a) codec b) modec c) sodec d) bodec

Description : In the multimedia contents, coding and decoding is performed by a software component known as _______. a) codec b) modec c) sodec d) bodec

Last Answer : a) codec

In the multimedia contents, which process is done by a software ? a) Conversion (coding) b) Reverse conversion c) (A) and (B) both d) None of these

Description : In the multimedia contents, which process is done by a software ? a) Conversion (coding) b) Reverse conversion c) (A) and (B) both d) None of these

Last Answer : c) (A) and (B) both

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

Earliest name of the facsimile coding is___________. a. Feminine b. CALIC c. Telephone d. Fax

Description : Earliest name of the facsimile coding is___________. a. Feminine b. CALIC c. Telephone d. Fax

Last Answer : d. Fax

A static dictionary technique that is less specific to a single application is: a. LZ77 b. Diagram Coding c. Initial dictionary d. LZW

Description : A static dictionary technique that is less specific to a single application is: a. LZ77 b. Diagram Coding c. Initial dictionary d. LZW

Last Answer : b. Diagram Coding

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

In the multimedia contents, coding and decoding is performed by a software component known as: a. codec b. modec c. sodec

Description : In the multimedia contents, coding and decoding is performed by a software component known as: a. codec b. modec c. sodec

Last Answer : a. codec

Information ignored the human eye is the a. A. coding redundancy b. B. spatial redundancy c. C. temporal redundancy d. D. irrelevant info

Description : Information ignored the human eye is the a. A. coding redundancy b. B. spatial redundancy c. C. temporal redundancy d. D. irrelevant info

Last Answer : d. D. irrelevant info

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

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

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

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%

By using data compression technique, what can be done in the data storage place of memory and disk ? a) increment b) Reduction c) Transfer d) Repetition

Description : By using data compression technique, what can be done in the data storage place of memory and disk ? a) increment b) Reduction c) Transfer d) Repetition

Last Answer : b) Reduction

Introns in genes (A) Encode the amino acids which are removed during post-translational modification (B) Encode signal sequences which are removed before secretion of the proteins (C) Are the non-coding sequences which are not translated (D) Are the sequences that intervene between two genes

Description : Introns in genes (A) Encode the amino acids which are removed during post-translational modification (B) Encode signal sequences which are removed before secretion of the proteins (C) Are the non-coding sequences which are not translated (D) Are the sequences that intervene between two genes

Last Answer : Answer : C

The basic algorithm initially attempts to use the _________context. a. Small b. Shortest c. Longest d. Zero

Description : The basic algorithm initially attempts to use the _________context. a. Small b. Shortest c. Longest d. Zero

Last Answer : c. Longest

How many bits are required to encode 32 level PCM:

Description : How many bits are required to encode 32 level PCM:  (1) 6 (2) 5 (3) 4 (4) 3

Last Answer : 5 bits are required to encode 32 level PCM.

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