Data compression

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41

Question 11

Easy

Select one option to show what code should be written at point P5 of the algorithm in Figure 1 to correctly implement run-length encoding.

Figure 1

sequence ← USERINPUT
compressed ← ""
count ← 1
i ← 0
WHILE i < LEN(sequence) - 1
    IF sequence[i] = sequence[i + 1] THEN
        count ← count + 1
    ELSE
        compressed ← compressed + TO_STRING(count) + sequence[i]
        count ← 1
    ENDIF
    P5
ENDWHILE
compressed ← compressed + TO_STRING(count) + sequence[LEN(sequence) - 1]
OUTPUT compressed

$\leftarrow i - 1$

$\leftarrow i + 1$

$\leftarrow i + 2$

$\leftarrow \text{count} + 1$

Data compression

Question 11

Data compression Questions

Data compression

Question 11

Data compression Questions