FINAL EXAM: COMPRESSION TECHNIQUES

I. Multiple Choice: STRICTLY NO ERASURES!!!

1. ___ audio/video refers to the broadcasting of radio and TV programs
through the Internet
A. Interactive
C. Streaming Stored
B. Streaming Live * D. none of the above
2. According to the Nyquist theorem, we need to sample an analog
signal ________times the highest frequency
A. Three
C. four
B. two *
D. none of the above
3. In ________ encoding, the differences between the samples are
encoded instead of encoding all the sampled values
A. predictive *
C. both a and b
B. perceptual
D. none of the above
4. _____ encoding is based on the science of psychoacoustics, which is
the study of how people perceive sound
A. predictive *
C. both a and b
B. perceptual
D. none of the above
5. ____ is used to compress images
A. MPEG
C. either a or b
B. JPEG *
D. none of the above
6. __ is used to compress video
A. MPEG *
C. either a or b
B. JPEG
D. none of the above
7. The first phase of JPEG is ____
A. DCT transformation *
B. Quantization
C. Data compression
D. None of the above
8. The second phase of JPEG is ___
A. DCT transformation
B. Data compression
C. Quantization *
D. None of the above
9. The third phase of JPEG is ___
A. DCT transformation
B. Data compression *
C. Quantization
D. None of the above
10. In a real-time video conference, data from the server is _______ to
the client sites
A. Unicast
C. broadcast
B. multicast *
D. none of the above
11. The basic idea behind Huffman coding is to
A. compress data by using fewer bits to encode fewer frequently
occurring characters
B. expand data by using fewer bits to encode more frequently
occurring characters
C. compress data by using fewer bits to encode more frequently
occurring characters *
D. compress data by using more bits to encode more frequently
occurring characters
12. Huffman coding is an encoding algorithm used for
A. lossless data compression *
B. lossy data compression
C. broadband systems
D. files greater than 1 Mbit
13. Huffman encoder takes a set of characters with a fixed length and
produces a set of characters of
A. random length
B. variable length *
C. fixed length
D. constant length
14. Its only possible to compress without of loss if the redundancy is
A. 1
C. =0
B. <0
D. >0 *
15. A compression ratio of 20:1 means the system bandwidth BW can be
reduced by a factor
A. 40
C. 10
B. 20
D. 5
16. When data s compressed, the goal is to reduce
A. Redundancy *
B. channel capacity
C. information
D. noise
17. An original ASCII file is 196 kbit. Huffman encoding produces a
compressed file whose size is 100 kbit. The redundancy is
A. 59%
C. 69%
B. 39%
D. 49% *
18. Its a must to use lossless compression for
A. Games
C. medical documents
B. digital audio D. digital video

19. Huffman coding is

A. is lossy
C. can be lossless or lossy
B. is lossless *D. reduce noise
20. ____ is used to compress images and ____ is used to compress
video
A. MPEG, JPEG
B. JPEG, MPEG
C. either a or b
D. none of the above
21. We wish to transmit a message using 9 symbols. Let us assume
fixed-length coding. What is the smallest number of bits per symbol?
A. 3 bits
C. 5 bits
B. 4 bits *
D. 6 bits
22. Which of the following describes the algrorithm complexity as the
evaluation criteria for data compression?
A. Redundancy
*
B. Compression
C. running time
D. all of the above
23. There is a compression technique that can be used for sound files. It
is known as ____
A. MPEG
C. GIF
B. MP3 *
D. JPEG
24. Reversible or lossless coding is a type of coding for which the exact
data can be recovered after decoding. This type of coding is used by
___
A. PCM encoding
B. Huffman encoding
C. Run-length encoding
D. Both b and c *
25. The information content of English writing 4.1 bits per letter. If 100
letter are to be transmitted every second, the bit rate is
A. 100 bits/s
C. 24.4 bits/s
B. 410 bits/s
D. 4100 bits/s
II. Fill in the blanks: STRICTLY NO ERASURES!!!
1. ___ is the type of image scanning where odd and even lines are
displayed on alternate frames.
2. ____ is the information stored/ transmitted per unit time.
3. ____ standard for multimedia application.
4. ____ describes how many samples per second the recording
consists of.
5. ____ is a standard technology and format for compression of a
sound sequence into a very small file.
6. Resolution is the number of pizels per ____.
7. In _____ redundancy, pixels are replicated within a single frame
of video.
8. In MP3, the purpose of scalefactors is to reduce the ___.
9.
_____ is basically a process of converting a given video input
into a digital format that is compatible with most types of Web
players and mobile devices.
10. In MP3 encoding, ___is the final block where the defined
bitstream is generated.
III. Enumeration: STRICTLY NO ERASURES!!!
1-2 Types of Video Scanning
3-5 Types of frames
6-9 Four different channel modes in MP3
10-12 At least 3 applications of MPEG-2 video compression
13-15 Three diff parts in MPEG-1 Standard
16-18 Three Intra-frae compression techniques
19-23 Five parts in the frame layout
24-25 Two types of bit rate
IV. MASTERY:
1. The number of bits in a message are reduced from 560 bits to 440 bits.
Compute the redundancy.
2. The size of an original uncompressed video file is 3.4 Mbit. By
compression the file is reduce to 600 kbit. What is the compression
ratio?
3. Consider file with symbols a, b, c and d. Suppose P(a) = , P(b)
= , P(c) =1/8, and P(d) = 1/8. Find the entropy (per symbol).