Data Compression (KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.TECH CSE-3RD YEAR

6/9/2021 Data Compression ( KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.
TECH CSE-3RD YEAR
Data Compression ( KCS-064)
FIRST SESSIONAL EXAM 2020-21
EVEN SEMESTER
B.TECH CSE-3RD YEAR

Time: 3:15 PM to 4:00 PM Date:
09/06/2021
(45 Minutes) Total

Marks: 30
Note:
Attempt all questions.
The question paper contains 30 MCQ type questions.
Each question carries equal marks.
There is no negative marking.
1. The set of binary sequences is called a _________, and the individual members of
the set are called __________. .*
(1 Point)
a) Code, Codewords
b) Codewords, Code
2. LZ77 and LZ78 are the two algorithms published in papers by Abraham Lempel
and Jacob Ziv in 1977 and 1978 is *
(1 Point)
a) Lossy data compression

https://forms.office.com/pages/responsepage.aspx?id=HYRhfOZJQEWQuVexaKFN-GuxzY-VkRFJlnHATTZmhCFUODNCV1VaVkJJMTlRU0dYTEd… 1/10
6/9/2021 Data Compression ( KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.TECH CSE-3RD YEAR
b) Lossless data compression
c) Both
d) None of the above
3. Calculate the entropy for : P(A) = 0.4, P(B) = 0.2, P(C) = 0.2, P(D) = 0.1 and P(E) =
0.1 *
(1 Point)
a) 1.24
b) 1.22
c) 1.28
d) 1.30
4. Adaptive dictionary – *
(1 Point)
a) holding strings previously found in the input stream
b) allowing for additions and deletions of strings as new input symbols are being read
c) sometimes allowing the addition of strings but no deletions
d) Both (a) and (b)
e) Both (a) and (c)
5. Full form of GIF *

(1 Point)
a) Graphics Interchange Form
b) Graphics Inter Format
c) Graphics Interchange Format
d) Graphics Interact Format
6. Which of these image file formats support Lossless Compression techniques? *

(1 Point)
a) PNG
b) GIF
c) BMP
d) SVG
e) All the above
7. In LZ1, the encoder uses the ___________ format. *

(1 Point)
a) Double <i, c>
b) Triplet <o, l, c>
c) Both (a) and (b)
8. The unit of information depends on the base of the log.
If we use log base e, the unit is ___________
if we use log base 10, the unit is ___________
and if we use log base 2, the unit is ____________. .*

(1 Point)
a) hartleys, nats, bits
b) nats, hartleys, bits
c) bits, hartleys, nats
d) bits, nats, hartleys
9. Composite source models is a combination or composition of several sources. In

which how many source being active at any given time? *
(1 Point)
a) All
b) Only one
c) Any two
d) None of these
10. If the P(E) =1, it means event : *

(1 Point)
a) Does not occur
b) Always occur
c) No probability
d) Normalization
11. In LZ77, the window consists of ____ parts. *

(1 Point)
a) 3
b) 2
c) 1
d) None of them
12. Lossy techniques are generally used for the compression of data that originate as
analog signals, such as *
(1 Point)
a) Speech
b) Video
c) Both
d) None of these
13. In LZ77, the offset represents: *

(1 Point)
a) The length of the match.
b) The codeword corresponding to the symbol in the look-ahead buffer that follows the
match.
c) The distance of the pointer from the Look-ahead-Buffer.
d) Both (a) and (c)
14. In dictionary techniques for data compression, which approach of building

dictionary is used for the prior knowledge of probability of the frequently
occurring patterns? *
(1 Point)
a) Static dictionary
b) Adaptive dictionary
c) Both
15. A Huffman code: A = 1, B = 000, C = 001, D = 01 and P(A) = 0.4, P(B) = 0.1, P(C)
= 0.2, P(D) = 0.3 The average number of bits per letter is *
(1 Point)
a) 1.7 bits
b) 1.8 bits
c) 1.9 bits
d) None of them
16. In Rice Code, using Split sample sequence for given details n= 25 , k= 8 bits ,
m= 3 split sample, the unary code is : *
(1 Point)
a) 11110
b) 1110
c) 110
d) None of them
17. In the encoded file, which type of changes are made in symbols. *
(1 Point)
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
18. In Huffman coding, data in a tree always occur in *

(1 Point)
a) Roots
b) Leaves
c) Both (a) & (b)
d) None of them
19. In Arithmetic coding, the __________ is used to distinguish a sequence of symbol to

another sequence of symbol. *
(1 Point)
a) Codeword
b) Tag
c) Variable length code
d) None of them
20. For models used in lossless compression, we use a specific type of Markov process
called a *
(1 Point)
a) Constant time Markov chain
b) Continous time Markov chain
c) Discrete time Markov chain
21. Based on the requirements of reconstruction, data compression schemes can be

divided into broad classes *
(1 Point)
a) 2
b) 3
c) 4
d) 5
22. The ratio of the number of bits required to represent the data before compression
to the number of bits required to represent the data after is called Compression
ratio. *
(1 Point)
a) True
b) False
23. The full form of PPM coding is *

(1 Point)
a) Partial with Predictive match
b) Partial and Predictive match
c) Predictive with Partial match
d) Predictive and Partial match
24. Which is a type of data compression? *

(1 Point)
a) Zipping
b) Resolution
c) Inputting
d) Caching
25. Which best describes Lossless compression ? *

(1 Point)
a) No information is lost but file size increased.
b) There is no loss in information at all after compression.
c) File which have the exact same data after compression.
d) Compression that involves an algorithm.
26. In the Tunstall code, all codewords are of __________ length. However, each
codeword represents a _________number of letters. *
(1 Point)
different, equal
equal, different
equal, equal
different, different
27. Which of the following is true of lossy and lossless compression techniques? *
(1 Point)
a) Lossless compression is only used in situations where lossy compression techniques

can’t be used
b) Neither lossy nor lossless compression can actually reduce the number of bits needed to
represent a file
c) Both lossy and lossless compression techniques will result in some information being
lost from the original file
d) Lossy compression is best suited for situations where some loss of detail is tolerable,
especially if it will not be detectable by a human
28. Compression is the method which eliminates the data which is not noticeable and
compression does not eliminate the data which is not. *
(1 Point)
a) Lossless, lossy
b) Lossy, lossless
c) None of these
29. 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. T
he Huffman code is *
(1 Point)
a) A = 01 B = 111 C = 110 D = 10
b) A = 0 B = 11 C = 10 D = 111
c) A = 0 B = 111 C = 11 D = 101
d) A = 0 B = 111 C = 110 D = 10
30. Which code is UDC? *

(1 Point)
a) {0, 01, 11}
b) {0, 01, 10}
c) Both of them
d) None of them
This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is not
responsible for the privacy or security practices of its customers, including those of this form owner. Never give out your
password.
Powered by Microsoft Forms | Privacy and cookies | Terms of use

Data Compression (KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.TECH CSE-3RD YEAR

Uploaded by

Copyright:

Available Formats

Data Compression (KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.TECH CSE-3RD YEAR

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Compression (KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.TECH CSE-3RD YEAR

Uploaded by

Copyright:

Available Formats

6/9/2021 Data Compression ( KCS-064) FIRST SESSIONAL EXAM 2020-21 EVEN SEMESTER B.

TECH CSE-3RD YEAR

Data Compression ( KCS-064)

FIRST SESSIONAL EXAM 2020-21

B.TECH CSE-3RD YEAR

(45 Minutes) Total

Attempt all questions.

The question paper contains 30 MCQ type questions.

Each question carries equal marks.

There is no negative marking.

a) Lossy data compression

b) Lossless data compression

d) None of the above

a) holding strings previously found in the input stream

c) sometimes allowing the addition of strings but no deletions

d) Both (a) and (b)

e) Both (a) and (c)

5. Full form of GIF *

a) Graphics Interchange Form

b) Graphics Inter Format

c) Graphics Interchange Format

d) Graphics Interact Format

6. Which of these image file formats support Lossless Compression techniques? *

e) All the above

7. In LZ1, the encoder uses the ___________ format. *

a) Double <i, c>

b) Triplet <o, l, c>

c) Both (a) and (b)

d) None of the above

8. The unit of information depends on the base of the log.

If we use log base e, the unit is ___________

if we use log base 10, the unit is ___________

and if we use log base 2, the unit is ____________. .*

a) hartleys, nats, bits

b) nats, hartleys, bits

c) bits, hartleys, nats

d) bits, nats, hartleys

9. Composite source models is a combination or composition of several sources. In

10. If the P(E) =1, it means event : *

a) Does not occur

11. In LZ77, the window consists of ____ parts. *

13. In LZ77, the offset represents: *

a) The length of the match.

c) The distance of the pointer from the Look-ahead-Buffer.

d) Both (a) and (c)

14. In dictionary techniques for data compression, which approach of building

d) None of the above

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

18. In Huffman coding, data in a tree always occur in *

c) Both (a) & (b)

19. In Arithmetic coding, the __________ is used to distinguish a sequence of symbol to

c) Variable length code

a) Constant time Markov chain

b) Continous time Markov chain

c) Discrete time Markov chain

d) None of the above