Data Compression Objective Question
1. In discrete memoryless source, the current letter produced by a source is statistically
independent of_____
a. Past output
b. Future output
c. Both a and b
d. None of the above
2. Which coding terminology deals with the inverse operation of assigned words of
second language corresponding to the words in the first language?
a. Enciphering
b. Deciphering
c. Codeword
d. Codebook
3. Which bitmap file format/s support/s the Run Length Encoding (RLE)?
a. TIFF
b. BMP
c. PCX
d. All of the above
4. 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
5. Which type of channel does not represent any correlation between input and output
symbols?
a. Noiseless Channel
b. Lossless Channel
c. Useless Channel
d. Deterministic Channel
6. In channel coding theorem, channel capacity decides the _________permissible rate at
which error free transmission is possible.
a. Maximum
b. Minimum
c. Constant
d. None of the above
7. If the channel is bandlimited to 6 kHz & signal to noise ratio is 16, what would be the
capacity of channel?
a. 15.15 kbps
b. 24.74 kbps
c. 30.12 kbps
d. 52.18 kbps
8. According to Shannon's second theorem, it is not feasible to transmit information over
the channel with ______error probability, although by using any coding technique.
a. small
b. large
c. stable
d. unpredictable
9. Which among the following represents the code in which codewords consists of
message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
10. Which among the following represents the code in which codewords consists of
message bits and parity bits separately?
a. Block Codes
b. Systematic Codes
c. Code Rate
d. Hamming Distance
11. In a linear code, the minimum Hamming distance between any two code words is
______minimum weight of any non-zero code word.
a. Less than
b. Greater than
c. Equal to
d. None of the above
12. Basically, Galois field consists of ______ number of elements.
a. Finite
b. Infinite
c. Both a and b
d. None of the above
13. According to linearity property, the ________ of two code words in a cyclic code is
also a valid code word.
a. sum
b. difference
c. product
d. division
14. What is the value of leading coefficient of a monic polynomial?
a. 0.5
b. 1
c. 4
d. 16
15. While decoding the cyclic code, if the received code word is similar as transmitted
code word, then r(x) mod g(x) is equal to _________
a. Zero
b. Unity
c. Infinity
d. None of the above
16. For designing of (4,1) cyclic repetition code, what would be the order of the generator
polynomial g(x)?
a. 1
b. 3
c. 4
d. 5
17. 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
18. The partition in which the tag resides depends on the ________of the sequence being
encoded.( first symbol)
19. Dictionary order is sometimes used as a synonym for _________order.(
lexicographic)
20. The ordering of words in a dictionary is a good (maybe the original) example of
________ordering. (lexicographic)
21. Static dictionary technique is most appropriate when considerable ___________
about the source is available.( prior knowledge)
22. A static dictionary technique that is less specific to a single application
is________________. (digram coding)
23. The dictionary consists of all letters of the source _______followed by as many pairs
of letters, called digrams (alphabet)
24. The digram encoder reads a __________input and searches the dictionary to see if
this input exists in the dictionary.( two-character)
25. The approaches based on the 1977 paper are said to belong to the______ family.(
LZ77)
26. Window consists of two parts, a _________ and _________ .
27. The distance of the pointer from the look-ahead buffer is called the_______.( offset)
28. LZ77 scheme is a __________scheme.( adaptive)
29. In LZ78 inputs are coded as a __________.(double)
30. best-known applications of LZW:_____, and_______.( GIF ,V.42 bis)
31. The UNIX compress command is one of the earlier applications of_______.( LZW)
32. ___________has become quite popular for encoding all kinds of images, both
computer-generated and “natural” images. (GIF)
33. The best-known context-based algorithm is the ____algorithm,(PPM)
34. The basic algorithm initially attempts to use the _________context.( largest)
35. An ________is encoded and the algorithm attempts to use the next smaller
context.( escape symbol)
36. The CALIC scheme actually functions in two modes, one for _________and another
for bi-level images.( gray-scale images)
37. In facsimile transmission, a page is scanned and converted into a sequence
of___________. (black or white pixels)
38. One that is not a type of data redundancy is
A. coding
B. spatial
C. temporal
D. facsimile
Answer D
49. The dictionary in LZ encoding consists of ______ entries that refer to substrings
in the original file.(indexed)
40. Lempel-Ziv encoding is a type of ________-based encoding.(dictionary)
41. Run length encoding is a compression method in which repeated ______ of a symbol
are replaced.(occurance)
