Compression method use for Integer type data
a. Huffman
b. LZ77
c. Golomb Code
d. Adaptive Huffman

1 Answer

Answer :

c. Golomb Code

Related questions

Description : The UNIX compress command is one of the earlier applications of a. LZ77 b. LZ78 c. Huffman d. LZW

Last Answer : d. LZW

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

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

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

Last Answer : b. LZ77

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Last Answer : B. Lossless

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

Last Answer : B. zipping

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

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

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.

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

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.

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

Last Answer : A. Temporarily removes data

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.

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

Description : Compression in general makes it _______ to send, upload and stream data A. Quicker B. Slower

Last Answer : A. Quicker

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

Last Answer : A. True

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

Description : From the following for which process ‘Archive Manager tool ‘ is used ? a) For transferring the data of file and directory b) For place compression on the file and directory c) For altering the form of file and directory d) For data compression on file and directory

Last Answer : d) For data compression on file and directory

Description : What is the reason that in the beginning of encoded file there is data telling which digit/letter represents which word ? a) It is needed to convert the file in compression form b) it is ... convert the file in its original uncompressed form d) it is needed to convert the file in graphical form

Last Answer : c) it is needed to convert the file in its original uncompressed form

Description : In data compression technique, each word is represented by what ? a) Digit b) Letter c) a or b d) Picture

Last Answer : c) a or b

Description : Which technique identify and eliminate less important information to conserve space ? a) Data compression b) Data repetition c) Data extension d) Data conservation

Last Answer : a) Data compression

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

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

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

Description : The difference between the original and reconstructed data, which we will refer to as the ______in the reconstructed data. a. Redundancy b. Compression c. loss d. Distortion

Last Answer : d. Distortion

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

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

Last Answer : A. Lossy