Skip to main content

Engineering Computer Science EBK DATA STRUCTURES AND ALGORITHMS IN C

To decode the strings coded as 1 2 4 3 1 4 9 5 8 1 2 2 using LZW with the table initialized with the letters a, b, c. LZW Decoding Procedure: • The decoding algorithm first reads a codeword from the given input, then searches the table for the codeword and places the substring related to the codeword. • With the present working string, the first letter of the substring is concatenated. • This concatenated string is added as new entry to the table. • Now the present working string is assigned with decoded string. And the procedure is processed repeatedly until there is no codeword left in the encoded input. Decoding: The decoding of 1 2 4 3 1 4 9 5 8 12 2 is as follows: Therefore, the decoded string is ababcaabababaaaaaab. Explanation : Initialize the table with a = 1, b = 2 and c = 3. Codeword=1: • Initially prior codeword is null, so place the string for the codeword. • Therefore “a” is put on the output. Set the prior codeword to “1”. Codeword=2: • Now the prior codeword is “1”. • The codeword exist in the table. • So, make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. Now the prior codeword is “8”. • The codeword is not present in the table. • So make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. • Then add this concatenated string as new entry to the table. So, the code “12” with the string “aaa” is added as new entry to the table. • Also, add the concatenated string to the output string. • Now the output contains “ababcaababaabaaaaaa”. • Set prior codeword to “12”. Codeword=2: • Now the prior codeword is “12”. • The codeword exist in the table. • So make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. • Then add this concatenated string as new entry to the table. So the code “13” with the string “aaab” is added as new entry to the table. • Then, from the table add the matching string of the codeword to the output string. • Now the output contains “ababcaabababaaaaaab”.

To decode the strings coded as 1 2 4 3 1 4 9 5 8 1 2 2 using LZW with the table initialized with the letters a, b, c. LZW Decoding Procedure: • The decoding algorithm first reads a codeword from the given input, then searches the table for the codeword and places the substring related to the codeword. • With the present working string, the first letter of the substring is concatenated. • This concatenated string is added as new entry to the table. • Now the present working string is assigned with decoded string. And the procedure is processed repeatedly until there is no codeword left in the encoded input. Decoding: The decoding of 1 2 4 3 1 4 9 5 8 12 2 is as follows: Therefore, the decoded string is ababcaabababaaaaaab. Explanation : Initialize the table with a = 1, b = 2 and c = 3. Codeword=1: • Initially prior codeword is null, so place the string for the codeword. • Therefore “a” is put on the output. Set the prior codeword to “1”. Codeword=2: • Now the prior codeword is “1”. • The codeword exist in the table. • So, make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. Now the prior codeword is “8”. • The codeword is not present in the table. • So make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. • Then add this concatenated string as new entry to the table. So, the code “12” with the string “aaa” is added as new entry to the table. • Also, add the concatenated string to the output string. • Now the output contains “ababcaababaabaaaaaa”. • Set prior codeword to “12”. Codeword=2: • Now the prior codeword is “12”. • The codeword exist in the table. • So make a new string by concatenating the first character of the matching string of the codeword with the matching string of the prior codeword. • Then add this concatenated string as new entry to the table. So the code “13” with the string “aaab” is added as new entry to the table. • Then, from the table add the matching string of the codeword to the output string. • Now the output contains “ababcaabababaaaaaab”.

Solution Summary: The author explains how to decode 1 2 4 3 1 4 9 5 8 12 2 using LZW. The decoding algorithm reads a codeword from the given input, then places the substring related to it.

EBK DATA STRUCTURES AND ALGORITHMS IN C

EBK DATA STRUCTURES AND ALGORITHMS IN C

4th Edition

ISBN: 9781285415017

Author: DROZDEK

Publisher: YUZU

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

Blurred answer

Chapter 11, Problem 10E

Chapter 11, Problem 1PA

Students have asked these similar questions

What bit string is stored in memory for the following 8 character string when using ASCII representation? (Use 8 bit cells): 822-7003

Separate the bit sequence into appropriate sized chuncks for each of the following domains. (You do NOT have to decode this bit sequence.) 1. Octal String: 010 110 101 010 101 111 010 111 111 101 011 011 011 011 010 1001. Hex String:1. Base64 String:

For the ASCII string “MTU 1885”, calculate the 2D parity, using even parity throughout. Consult an ASCII table like www.asciitable.com, use 7-bit ASCII codes, and note that the string has 8 characters, including the space.

Chapter 11 Solutions

EBK DATA STRUCTURES AND ALGORITHMS IN C

Ch. 11 - Prob. 1E Ch. 11 - Prob. 2E Ch. 11 - Prob. 3E Ch. 11 - Prob. 4E Ch. 11 - Prob. 5E Ch. 11 - Prob. 6E Ch. 11 - Prob. 7E Ch. 11 - Prob. 8E Ch. 11 - Prob. 9E Ch. 11 - Prob. 10E

Ch. 11 - Prob. 11E Ch. 11 - Prob. 1PA Ch. 11 - Prob. 2PA

Knowledge Booster

Background pattern image

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L

Text book image

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

Text book image

COMPREHENSIVE MICROSOFT OFFICE 365 EXCE

Computer Science

ISBN:9780357392676

Author:FREUND, Steven

Publisher:CENGAGE L

SEE MORE TEXTBOOKS