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

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
by

1 Answer

Answer :

C. difference in bits / bits in ASCII * 100
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

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

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

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

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

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

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

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.

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.

Which button can be used in the Archive manager toolbar, to create a compressed file into uncompressed ? a) Open button b) Home button c) Extract d) Up button

Description : Which button can be used in the Archive manager toolbar, to create a compressed file into uncompressed ? a) Open button b) Home button c) Extract d) Up button

Last Answer : c) Extract

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

Using gzip program an uncompressed file in the tar format is compressed in the zip format, by providing which extension ? a) tar b) tar.gz c) tar.gz d) zip

Description : Using gzip program an uncompressed file in the tar format is compressed in the zip format, by providing which extension ? a) tar b) tar.gz c) tar.gz d) zip

Last Answer : c) tar.gz

In the encoded file, by using which process it can be transformed into original file at any time ? a) Straight b) Reverse c) Transfer d) Compressed

Description : In the encoded file, by using which process it can be transformed into original file at any time ? a) Straight b) Reverse c) Transfer d) Compressed

Last Answer : b) Reverse

In the encoded file, which type of changes are made in sysmbols ? a. They are compressed b. They are changed to a letter or symbol c. They are represented in the graphical form d. No changes are made

Description : In the encoded file, which type of changes are made in sysmbols ? a. They are compressed b. They are changed to a letter or symbol c. They are represented in the graphical form d. No changes are made

Last Answer : d. No changes are made

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

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

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

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

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

A wave in which the wave’s medium is compressed in the same direction as the movement of the wave A. Transversal wave B. Transverse wave C. Frequency wave D. compression wave

Description : A wave in which the wave’s medium is compressed in the same direction as the movement of the wave A. Transversal wave B. Transverse wave C. Frequency wave D. compression wave

Last Answer : C. Frequency wave

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 

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%

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

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

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

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

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

Ms. Matthews is printing posters of her students' artwork. Since the images will be printed, they will need: A. a higher resolution for better print quality. B. a lower resolution for smaller file size. C. a higher resolution to display on a monitor. D. a lower resolution in order to download faster.

Description : Ms. Matthews is printing posters of her students' artwork. Since the images will be printed, they will need: A. a higher resolution for better print quality. B. a lower resolution for smaller ... a higher resolution to display on a monitor. D. a lower resolution in order to download faster.

Last Answer : A. a higher resolution for better print quality.

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

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

The purpose of data compression is to decrease file sizes . A. True B. False

Description : The purpose of data compression is to decrease file sizes . A. True B. False

Last Answer : A. True