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

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
by

1 Answer

Answer :

C. 0 = left 1 = right
by

Related questions

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

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

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

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

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

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

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

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

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

All Waves A. Have troughs and nodes B. Move back and forth C. Transfer energy D. are big

Description : All Waves A. Have troughs and nodes B. Move back and forth C. Transfer energy D. are big

Last Answer : A. Have troughs and nodes

What is done firstly, to create a compressed and archive file into uncompressed ? a) Left clicking a file -> Open with archive manager b) Right clicking a file -> open with archive manager c) Left clicking a file -> open with Winzip d) Right clicking a file -> open with winzip

Description : What is done firstly, to create a compressed and archive file into uncompressed ? a) Left clicking a file -> Open with archive manager b) Right clicking a file -> open with archive manager c) Left clicking a file -> open with Winzip d) Right clicking a file -> open with winzip

Last Answer : b) Right clicking a file -> open with archive manager

Where in the encoded file, one can have the data that tells which digit/letter represents which word ? a) Beginning b) Middle c) Ending d) None of these

Description : Where in the encoded file, one can have the data that tells which digit/letter represents which word ? a) Beginning b) Middle c) Ending d) None of these

Last Answer : a) Beginning

TSVQ stands for _________. A. tree structured vector quantizers B. tree structured valid quantizers C. tree unStructured vector quantizers D. tree structured vector quantity

Description : TSVQ stands for _________. A. tree structured vector quantizers B. tree structured valid quantizers C. tree unStructured vector quantizers D. tree structured vector quantity

Last Answer : A. tree structured vector quantizers

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

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

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.

A back-and-forth pattern of motion that transfers energy A. Wave B. Pulse C. Reflection D. Frequency

Description : A back-and-forth pattern of motion that transfers energy A. Wave B. Pulse C. Reflection D. Frequency

Last Answer : D. Frequency

From the following, which option shows an issue faced with multimedia contents ? a) Converting multimedia information coming from hardware devices into computer data b) converting the computer data back into audio/video streams for playing on the hardware device c) a and b both d) None of these

Description : From the following, which option shows an issue faced with multimedia contents ? a) Converting multimedia information coming from hardware devices into computer data b) converting the computer data back into audio/ ... for playing on the hardware device c) a and b both d) None of these

Last Answer : c) a and b both

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.

A wave in which the movement of the wave’s medium is perpendicular to the movement of the wave traveling through the medium A. Transverse waves B. Compression waves C. Nodular Waves D. Ocean Waves

Description : A wave in which the movement of the wave’s medium is perpendicular to the movement of the wave traveling through the medium A. Transverse waves B. Compression waves C. Nodular Waves D. Ocean Waves

Last Answer : A. Transverse waves

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

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

Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Description : Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1,P(E) =0.1 a. 1.24 b. 1.22 c. 1.28 d. 1.30

Last Answer : b. 1.22

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