Hashing Checksums Quiz: Applications in Coding – Hashing, Checksums, and Cyclic Redundancy

Reviewed by Editorial Team
The ProProfs editorial team is comprised of experienced subject matter experts. They've collectively created over 10,000 quizzes and lessons, serving over 100 million users. Our team includes in-house content moderators and subject matter experts, as well as a global network of rigorously trained contributors. All adhere to our comprehensive editorial guidelines, ensuring the delivery of high-quality content.
Learn about Our Editorial Process
| By Thames
T
Thames
Community Contributor
Quizzes Created: 7682 | Total Attempts: 9,547,133
| Questions: 20 | Updated: Dec 16, 2025
Please wait...
Question 1 / 20
0 %
0/100
Score 0/100
1) What is the main purpose of a checksum in computing?

Explanation

Checksums detect errors by verifying computed remainder matches transmitted value.

Submit
Please wait...
About This Quiz
Hashing Checksums Quiz: Applications In Coding Hashing, Checksums, And Cyclic Redundancy - Quiz

Curious how computers catch errors or protect data? This quiz walks you through hashing, checksums, and cyclic redundancy with easy-to-understand examples. You’ll see how tiny input changes produce big output shifts and how checksums help detect mistakes. Explore the logic behind data integrity and see how these ideas show up... see morein everyday tech.
see less

2)
You may optionally provide this to label your report, leaderboard, or certificate.
2) A checksum can always guarantee that no errors exist in data.

Explanation

Checksums detect many errors but collisions mean they cannot guarantee error-free data.

Submit
3) A checksum is computed as (sum of bytes) % 256. If the total sum of bytes is 765, what is the checksum?

Explanation

765 % 256 = 253 since 256×2=512→765−512=253.

Submit
4) In hashing, to limit hash values to fit inside an array of size m, we compute hash % __.

Explanation

Modulo m ensures result in 0–(m−1).

Submit
5) What is 98765 % 101 when computing a simple hash?

Explanation

101×977=98677→98765−98677=88.

Submit
6) Which operation in Cyclic Redundancy Checks (CRC) corresponds to addition in modulo-2 arithmetic?

Explanation

In GF(2), addition=subtraction=XOR with no carry.

Submit
7) CRCs usually provide stronger error detection than simple addition-based checksums.

Explanation

CRCs detect burst and pattern errors using polynomial division.

Submit
8) The identity (A + B) % m equals ((A % m) + (B % m)) % __.

Explanation

Modulo distributes over addition; final remainder mod m.

Submit
9) If the sum of bytes in a message is 3210, what is the checksum value using modulus 255?

Explanation

3210 % 255 = 150 since 255×12=3060→3210−3060=150.

Submit
10) Which of the following best describes the role of a hash function?

Explanation

Hash maps data to fixed numeric output used for indexing or comparison.

Submit
11) Hashing with modulus operations can cause collisions where different inputs produce the same hash.

Explanation

Modulo reduces many inputs to fewer outputs; collisions are inevitable.

Submit
12) In CRC generation, the transmitted frame consists of the original data followed by the __ bits.

Explanation

The remainder from division by the generator polynomial is appended.

Submit
13) A hash table has 10 buckets. If a key’s raw hash value is 127, which index is used to store the key?

Explanation

127 % 10 = 7.

Submit
14) Modulo operations are used in hash tables to ensure hash values stay within the number of available buckets.

Explanation

hash % bucketCount gives index 0–(bucketCount−1).

Submit
15) What is the checksum value of a file whose byte sum is 1048 when using modulus 256?

Explanation

1048 % 256 = 24 since 256×4=1024→1048−1024=24.

Submit
16) In CRC arithmetic, addition and subtraction are replaced by the bitwise operation __.

Explanation

Over GF(2), addition=subtraction=XOR.

Submit
17) A simple hash function is defined as hash(x) = (3x + 7) % 10. What is hash(8)?

Explanation

3×8+7=31→31 % 10 = 1.

Submit
18) CRC uses polynomial long division over GF(2) to compute a remainder that is sent with the data.

Explanation

CRC divides message polynomial by generator polynomial in GF(2).

Submit
19) Select all correct statements about hashing and checksums.

Explanation

A true (modulus); B false (collisions); C true (fast lookup); D true (error detection).

Submit
20) A 16-bit CRC remainder is 1100101010101110 in binary. What is this value in hexadecimal?

Explanation

1100= C, 1010= A, 1010= A, 1110= E → CAAE.

Submit
×
Saved
Thank you for your feedback!
View My Results
Cancel
  • All
    All (20)
  • Unanswered
    Unanswered ()
  • Answered
    Answered ()
What is the main purpose of a checksum in computing?
A checksum can always guarantee that no errors exist in data.
A checksum is computed as (sum of bytes) % 256. If the total sum of...
In hashing, to limit hash values to fit inside an array of size m, we...
What is 98765 % 101 when computing a simple hash?
Which operation in Cyclic Redundancy Checks (CRC) corresponds to...
CRCs usually provide stronger error detection than simple...
The identity (A + B) % m equals ((A % m) + (B % m)) % __.
If the sum of bytes in a message is 3210, what is the checksum value...
Which of the following best describes the role of a hash function?
Hashing with modulus operations can cause collisions where different...
In CRC generation, the transmitted frame consists of the original data...
A hash table has 10 buckets. If a key’s raw hash value is 127, which...
Modulo operations are used in hash tables to ensure hash values stay...
What is the checksum value of a file whose byte sum is 1048 when using...
In CRC arithmetic, addition and subtraction are replaced by the...
A simple hash function is defined as hash(x) = (3x + 7) % 10. What is...
CRC uses polynomial long division over GF(2) to compute a remainder...
Select all correct statements about hashing and checksums.
A 16-bit CRC remainder is 1100101010101110 in binary. What is this...
Alert!

Advertisement