MULTIMEDIA AND QUALITY OF SERVICE
COMPRESSION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which bit is reserved as a parity bit in an ASCII set?
|
|
Sixth
|
|
|
Seventh
|
|
|
Eighth
|
|
|
Ninth
|
Explanation:
Detailed explanation-1: -3. Which bit is reserved as a parity bit in an ASCII set? Explanation: In an ASCII character set, seven bits are reserved for character representation while the eighth bit is a parity bit.
Detailed explanation-2: -The correct answer is option 1. Concept: Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters.
Detailed explanation-3: -Huffman Coding is a famous Greedy Algorithm. It is used for the lossless compression of data. It uses variable length encoding.
There is 1 question to complete.