MCQS (Multimedia Technologies) CSE 1, 2, 3

What is the primary difference between compression and reconstruction?

• Compression reduces the size of data, while reconstruction restores the original data from compressed form.

• Compression increases the size of data, while reconstruction generates new data from compressed form.

• Compression and reconstruction perform the same task in data processing.

• Compression involves encrypting data, while reconstruction involves decrypting data.

Which CSS property is used to create rounded corners on elements?

• border-radius

• box-shadow

• text-shadow

• opacity

How does LZ77 handle non-repetitive data?

• By using a dictionary-based encoding scheme

• By compressing non-repetitive data more efficiently

• By maintaining a fixed-size sliding window

• By encoding non-repetitive data as literal symbols

How does the LZ77 compression algorithm identify repetitive patterns in the input data?

• By comparing each character with the next character

• By using a sliding window to search for matching substrings

• By applying arithmetic coding to the input data

• By randomly sampling the input data

How does the size of the arithmetic coding interval affect compression efficiency?

• A smaller interval size leads to higher compression ratios

• A larger interval size leads to higher compression ratios

• Compression efficiency is independent of the interval size

• Compression efficiency depends solely on the input data

In LZW compression, how are new entries added to the dictionary?

• By replacing repetitive pattern with shorter codes

• By incrementally building the dictionary from the input data

• By deleting entries that are not frequently used

• By dynamically updating the dictionary based on the input data

Which multimedia element involves the integration of Non-Temporal and Temporal Media?

• Hyperlink

• Hypermedia

• SVG (Scalable Vector Graphics)

• JPEG (Joint Photographic Experts Group)

What is the main difference between the Shannon-Fano algorithm and Huffman coding?

• Shannon-Fano uses fixed-length codes, while Huffman coding uses variable-length codes.

• Shannon-Fano codes symbols based on their probabilities, while Huffman coding uses a greedy approach.

• Shannon-Fano is more computationally efficient than Huffman coding.

• Shannon-Fano is only suitable for lossy compression, while Huffman coding is for lossless compression.

How does LZ77, a variant of Lempel-Ziv compression, identify repeating patterns in the input data?

• By constructing a tree-based data structure.

• By using a fixed-size sliding window and a lookahead buffer.

• By analyzing the frequency spectrum of the input data.

• By applying wavelet transformation to the input data.

How do scripts contribute to interactivity in multimedia applications?

• By defining the structure of multimedia elements

• By enabling users to navigate through different sections

• By controlling the behavior of multimedia elements

• By compressing multimedia files