Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Task 1 ( 2 P ) We have more than 3 2 but less than 6 3 characters, so we only need 6 bits instead
Task P We have more than but less than characters, so we only need bits instead of bits to
represent all the characters. The first method thus reduces the size. Each character of bits is replaced by a
character of bits and all bits come directly after each other. Depending on the number of characters, this
may mean that not exactly one byte comes out at the end. We then simply fill it up with en The only case in
which we can have an ambiguity is if the last bit word extends into the next byte with bits, leaving exactly
bits. Then the last bits are potentially another bit word. However, if we make sure that the bit does
not occur times as a correct character, then we can recognize the case. To do this, we simply have to
start with instead of to exclude as a valid bit word. We use the bit
patterns in ascending order as above, so a is equivalent to and so on For example, the text abc
is used as the bit pattern to with
the spaces inserted after bits for readability only. In the example, s have been inserted at the end
If you implement the procedure using a vector, you will learn how to handle bit sequences. We
compress with the a flag and decompress with the b flag. When compressing, we simply add the extension
kompein to the file name if the output file is not specified. When decompressing, we use out.txt if
the output file name is not specified. We abort with an error message if the input is not expected.
explain this task further and more deeply
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started