For the LZW algorithm, assume an alphabet $\{*$ a b o d $\}$ of size 5 from which text characters are picked.
Suppose the following string of characters is to be transmitted (or stored):
$\mathrm{dabba} * \mathrm{dabba} * \mathrm{dabba} * \mathrm{doo} * \mathrm{doo} \ldots$
The coder starts with an initial dictionary consisting of the above 5 characters and an index assignment, as in the following table:

Make a table showing the string being assembled, the current character, the output, the new symbol, and the index corresponding to the symbol, for the above input - only go as far as "d a b b a d a b b a * d".

Question

For the LZW algorithm, assume an alphabet $\{*$ a b o d $\}$ of size 5 from which text characters are picked. 
Suppose the following string of characters is to be transmitted (or stored):
$\mathrm{dabba} * \mathrm{dabba} * \mathrm{dabba} * \mathrm{doo} * \mathrm{doo} \ldots$
The coder starts with an initial dictionary consisting of the above 5 characters and an index assignment, as in the following table:
  
Make a table showing the string being assembled, the current character, the output, the new symbol, and the index corresponding to the symbol, for the above input - only go as far as "d a b b a d a b b a * d".

Quizplus · Accepted Answer

The Answer of For the LZW algorithm, assume an alphabet $\{*$ a b o d $\}$ of size 5 from which text characters are picked. 
Suppose the following string of characters is to be transmitted (or stored):
$\mathrm{dabba} * \mathrm{dabba} * \mathrm{dabba} * \mathrm{doo} * \mathrm{doo} \ldots$
The coder starts with an initial dictionary consisting of the above 5 characters and an index assignment, as in the following table:
  
Make a table showing the string being assembled, the current character, the output, the new symbol, and the index corresponding to the symbol, for the above input - only go as far as "d a b b a d a b b a * d".

For the LZW Algorithm, Assume an Alphabet {∗\{*{∗ A B O D

For the LZW Algorithm, Assume an Alphabet $\{*$ A B O D