If the probability is not given which method is preferable a. Huffman b. Non Binary Huffman c. Adaptive Huffman d. Extended Huffman

If the probability is not given which method is preferable a. Huffman
b. Non Binary Huffman
c. Adaptive Huffman
d. Extended Huffman
by

1 Answer

Answer :

c. Adaptive Huffman
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

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

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

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

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

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

Quantization techniques that operate on blocks of data are called a. Adaptive quantization b. Non uniform Quantization c. Scalar Quantization d. None of the Above

Description : Quantization techniques that operate on blocks of data are called a. Adaptive quantization b. Non uniform Quantization c. Scalar Quantization d. None of the Above

Last Answer : d. None of the Above

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

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

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

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

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

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

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

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

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

A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Description : A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15. A. Binary B. Decimal C. Hexadecimal D. Hepadeximal

Last Answer : A. Binary

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

Convert the binary number 01010101 to Hex A. 44 B. 55 C. 66 D. 77

Description : Convert the binary number 01010101 to Hex A. 44 B. 55 C. 66 D. 77

Last Answer : B. 55

Convert the Hex number DA to binary. A. 11001010 B. 11011011 C. 11011010 D. 11011110

Description : Convert the Hex number DA to binary. A. 11001010 B. 11011011 C. 11011010 D. 11011110

Last Answer : C. 11011010

A simple quantization scheme would be to represent each output of the source with the ____value closest to it. a. Codeword b. Integer c. Binary sequence d. Coordinates

Description : A simple quantization scheme would be to represent each output of the source with the ____value closest to it. a. Codeword b. Integer c. Binary sequence d. Coordinates

Last Answer : b. Integer

In facsimile transmission, a page is scanned and converted into a sequence of a. Binary sequence b. Ternary sequence c. black or white pixels d. alphanumeric sequence

Description : In facsimile transmission, a page is scanned and converted into a sequence of a. Binary sequence b. Ternary sequence c. black or white pixels d. alphanumeric sequence

Last Answer : c. black or white pixels

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

Window in dictionary method consists of ___________ parts a. 1 b. 3 c. 2 d. 4

Description : Window in dictionary method consists of ___________ parts a. 1 b. 3 c. 2 d. 4

Last Answer : c. 2

Quantization with one word memory is also called ______. A. Uniform quantizer B. non uniform quantizer C. Jayant Quantizer D. Midrise Quantizer

Description : Quantization with one word memory is also called ______. A. Uniform quantizer B. non uniform quantizer C. Jayant Quantizer D. Midrise Quantizer

Last Answer : C. Jayant Quantizer

Speed in a given direction A. Wavelength B. Frequency C. Velocity D. Waves per second

Description : Speed in a given direction A. Wavelength B. Frequency C. Velocity D. Waves per second

Last Answer : A. Wavelength

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

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

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