Term Test Flashcards
what is compression
Option A: To convert one file into another
Option B: To reduce the size of data to save space
Option C: To minimize the time taken for a file to be downloaded
Option D: To compress something by pressing very hard
To reduce the size of data to save space
A Huffman encoder takes a set of characters with fixed length and produces a set of characters of Option A: fixed length Option B: constant length Option C: variable length Option D: random length
fixed length
The difference between the entropy and average length of the Huffman code is called as Option A: Rate Option B: Redundancy Option C: Power Option D: Entropy
Redundancy
Which is a lossy compression method Option A: RLE Option B: Huffman coding Option C: JPEG Option D: LZW
JPEG
In the \_\_\_\_\_\_\_\_\_ approach, the dictionary is simply a portion of the previously encoded sequence. Option A:LZ78 Option B:LZW Option C:LZ77 Option D: Huffman coding
LZ77
No information is lost in\_\_\_\_\_ compression Option A: Lossless Option B: Lossy Option C: zero Option D: random
Lossless
The compression ratio is the ratio of.
Option A: the original file size to the size of the compressed file
Option B: the number of pixels in a frame of the original size to those in a frame of the compressed file
Option C: compressed file size to the original file size
Option D: pixels to the compression
the original file size to the size of the compressed file
The basic idea behind Huffman coding is to
Option A: compress data by using fewer bits to encode more frequently occurring characters
Option B: compress data by using fewer bits to encode fewer frequently occurring characters
Option C: expand data by using fewer bits to encode more frequently occurring characters
Option D: compress data by using more bits to encode more frequently occurring characters
compress data by using fewer bits to encode more frequently occurring characters
The window consists of two parts, a____________ that contains a portion of the recently encoded sequence.
Option A: Search buffer.
Option B: Look-ahead buffer. (contains the next portion of the sequence to be encoded.)
Option C: Offset
Option D: Matchpoint
Search buffer.
In Huffman tree, NYT stands for Option A: No yet transmitted Option B: Not yet transmission Option C: Not yet transmitted Option D: Not yet Transferred
Not yet Transferred
Find average information per message (H) for a Shannon -Fano code generating 5 different messages with probabilities 0.45, 0.3, 0.15, 0.05, 0.05 Option A: 2.057 bits/messages Option B: 2.15 bits/messages Option C: 1.881 bits/message Option D: 2.000 bits/message
1.881 bits/message
Using Run length Encoding compress the sequence B A A B A B B B A A B B B B A A
Option A: B A 2 B 3 B 1 A 4 B 5 A
Option B: 0 0 0 1 0 1 1 1 0 0 1 0 0 1 0 1
Option C: 1B 2A 1B 1A 3B 2A 4B 2A
Option D: B 1 A 2 B 1 A 1 B 3 A 2 B 4 A 2
1B 2A 1B 1A 3B 2A 4B 2A
Encode the string using LZ 77 algorithm a b a b c b a b a b a a
Option A: 0 10 110 1110 11110 11111
Option B: (0,0,a), (0,0,b), (2,2,c), (4,3,a), (2,2,a)
Option C: 5 2 3 3 2 1 6 8 10
Option D: <0, c(a)> <0, c(b)> <1, c(b)> <0, c(c)> <2, c(a)> <5, c(b)> <1, c(a)>
(0,0,a), (0,0,b), (2,2,c), (4,3,a), (2,2,a)
A zero memory source emits six messages (N, I, R, K , A, T) with probabilities (0.19, 0.15, 0.02, 0.16, 0.4,0.08) respectively. Given that A is coded as '0' Determine Shannon Fano code and tabulate it Option A: 0 10 110 1110 11110 11111 Option B: 0 100 101 110 1110 1111 Option C: 10 00 010 11 011 Option D: 1B 2A 1B 1A 3B 2A 4B 2A
0 100 101 110 1110 1111
In arithmetic coding if P(A) = 0.4, P(B) = 0.3, P(C) = 0.2 AND P(*) = 0.1, Decimal Tag = 0.5976 . find the original message. Option A: B B C C Option B: A B C * Option C: A * B C Option D: B A * C
B B C C
Joint Photographic Experts Group (JPEG) is used to compress Option A: Music Option B: Pictures Option C: Images Option D: Frames
Images
Inferior image is the image having Option A: Low definition Option B: High definition Option C: Intensity Option D: Coordinates
Low definition
Which of the following is an Image format? Option A: JPEG Option B: MP3 Option C: MPEG Option D: H.271
JPEG
Granular noise occurs when Option A: Step size is too small Option B: Step size is too large Option C: There is interference from the adjacent channel Option D: Bandwidth is too large
Step size is too large
Digitizing the image intensity amplitude is called Option A: Sampling Option B: Quantization Option C: Framing Option D: Both A and B
Quantization
Compressed image can be recovered back by Option A: Image enhancement Option B: Image decompression Option C: Image contrast Option D: Image equalization
Image decompression
DPCM is _________
Option A: Differential pulse code mixer
Option B: Differential pulse code modulation
Option C: Differential phase code modulation
Option D: Delayed pulse code modulation
Differential pulse code modulation
In PCM the samples are dependent on ________ Option A: Time
Option B: Frequency
Option C: Quantization Level
Option D: Interval between quantization level
Time
JPEG 2000 uses which transform method? Option A: Discrete Cosine Transform Option B: Discrete Wavelet Transform Option C: Haar Transform Option D: Orthogonal Transform
Discrete Wavelet Transform
.jpeg is the extension used by \_\_\_\_\_\_\_\_\_ compression scheme. Option A: DPCM Option B: JPEG Option C: JPEG 2000 Option D: CALIC
JPEG 2000
What are the steps in JPEG image compression standard ?
Option A: DCT- Quantization-Data Compression
Option B: DWT-Quantizer-Huffman and RLE
Option C: Segment generator- level shifter- encoder
Option D: DCT- level shifter-Huffman and RLE
DCT- Quantization-Data Compression
e(n Ts) = x(n Ts) – x^(n Ts) indicates Option A: Signal to noise ratio Option B: Quantization noise Option C: Prediction error Option D: Delay
Prediction error
For an pixel I(a,b) the I^(a,b) = I(a-1, b-1) is predictive scheme used by which compression technique Option A: JPEG lossless Option B: CALIC Option C: JPEG 2000 Option D: JPEG
JPEG
Moving Picture Experts Group (MPEG) is used to compress Option A: Frames Option B: Images Option C: Audio Option D: Video
Video
What is the full form of MPEG?
Option A: Motion Pictures Engineering Group
Option B: Motion Picture Engineers Group
Option C: Motion Picture Experts Group
Option D: Motion Picture Expertise Group
Moving Picture Experts Group (MPEG)
Moving Picture Experts Group (MPEG)
In Audio and Video Compression, each frame is divided into small grids, called picture elements or. Option A: Frames Option B: Packets Option C: Pixels Option D: Megapixels
Pixels
The most common compression technique that is used to create CD-quality audio is based on perceptual encoding technique is called Option A: Predictive Encoding Option B: Perceptual Encoding. Option C: MPEG Option D: JPEG
Perceptual Encoding
Streaming stored audio/video, files are compressed and stored on a Option A: IP Option B: Server Option C: Domain Option D: Internet
Server
A is the ratio of the relative sizes of the signal values and the errors. Option A: Signal to Noise Ratio (SNR) Option B: Compression Ratio Option C: RMS value Option D: Companding
Signal to Noise Ratio (SNR)
What are the two types of streaming techniques?
Option A: progressive download & real time streaming
Option B: regular download & real time streaming
Option C: real time & virtual time streaming
Option D: virtual time streaming
progressive download & real time streaming
Formula Pr = n/MN Represents the Option A: Coding redundancy Option B: Spatial redundancy Option C: Temporal redundancy Option D: Irrelevant Information
Coding redundancy
Digital video is sequence of Option A: Pixels Option B: Matrix Option C: Frames Option D: Coordinates
Frames
Which companding method uses Linear segment for low-level inputs and logarithmic segments for high-level inputs. Option A: µ - law companding Option B: A – law companding Option C: Uniform quantizer Option D: MPEG - 2
A – law companding
