Explain the use of hash algorithms to verify the integrity of lossless compressed data.
What will be an ideal response?
ANSWER: An easy way to test lossless compression is to perform an MD5 or SHA-1 hash on a file before and after it’s compressed. If the compression is done correctly, both versions have the same hash value. If the hashes don’t match, that means something corrupted the compressed file, such as a hardware or software error. As an added precaution, perform two separate hashes with different algorithms, such as MD5 and SHA-1. This step isn’t mandatory; however, it’s a good way to establish that nothing has changed during data processing.
You might also like to view...
What is the most commonly used type of database according to the book's authors?
1. flat file 2. document-based 3. relational 4. No SQL
What type of computer language uses English-like abbreviations for machine language instructions? _______.
Fill in the blank(s) with the appropriate word(s).
In a mail merge, the ________ contains the variable information, such as specific client and company names
A) data source B) main document C) works cited page D) header and footer
Many programs written with inheritance could be solved with composition instead, and vice versa. Discuss the relative merits of these approaches in the context of the Point, Circle, Cylinder class hierarchy in this chapter. Rewrite the classes in Figs. 9.6–9.8 (and the supporting programs) to use composition rather than inheritance. After you do this, reassess the relative merits of the two
approaches both for the Point, Circle, Cylinder problem and for object-oriented programs in general. What will be an ideal response?