Transform Coding Checkpoint

BWT, MTF, and zero-run RLE.

1. BWT outputs:

Last column + primary index First column only Only a histogram A Huffman tree

2. BWT is reversible because:

The primary index identifies the original row The last column is sorted It encodes entropy directly It does not change the data

3. MTF encoding does what?

Outputs the index of the symbol and moves it to front Sorts the symbols Outputs entropy Encodes runs directly

4. After BWT, MTF tends to produce:

Many zeros and small indices Uniform random indices Only negative values Only large indices

5. Zero-run RLE encodes a run of k zeros as:

-k k k zeros plus a terminator k^2

6. True/False: BWT alone compresses data without any coding stage.

7. The main benefit of the BWT->MTF->RLE pipeline is:

It creates a skewed distribution for entropy coding It always yields lossless compression It eliminates the need for Huffman coding It guarantees constant output size

Auto-advance on pass