🏠 Home > Data Communication & Networks > 10. Error Detection and Correction > Hamming Distance Error Detecting Technique
← Back to 10. Error Detection and Correction

📝 Hamming Distance Error Detecting Technique

📖 From Data Communication & Networks • 10. Error Detection and Correction • 11 questions available

Practice MCQs for Hamming Distance Error Detecting Technique. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-31

3
Easy Questions
5
Medium Questions
3
Hard Questions

📝 Sample Questions

Q1. What operation is performed on the final sum to obtain the checksum in the traditional checksum algorithm?

🔹 A. One's complement addition
🔹 B. Two's complement addition
🔹 C. One's complement (bitwise NOT)
🔹 D. Left shift by 1

💡 Difficulty: easy | ✅ Correct: C

Q2. If a single 16‑bit word in a message is altered during transmission, will the traditional checksum detect the error?

🔹 A. Detected only if error changes parity
🔹 B. Not detected if error is zero
🔹 C. May go undetected if error cancels with another error
🔹 D. Always detected

💡 Difficulty: medium | ✅ Correct: D

Q3. Which characteristic of the Fletcher checksum allows it to catch transposition errors that the traditional checksum cannot?

🔹 A. Use of one's complement arithmetic
🔹 B. Truncation to 16 bits
🔹 C. Adding overflow back into the sum
🔹 D. Weighting each word by its position index

💡 Difficulty: hard | ✅ Correct: D

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Types of Errors in Data Link Layer📝 Redundancy error detecting and correcting📝 Error Detection versus Correction in Data Link Layer📝 Redundancy hrough Coding📝 Block Coding in Data Link Layer
🚀 Start Quiz 📝 Practice Mode