Computer Networks · Question 14 · Hard
How many redundant (parity) bits does a Hamming code need to correct single-bit errors in a 7-bit data word?
- 5
- 3
- 4
- 7
Answer and explanation
Answer: C. 4
Explanation: We need the smallest r with 2^r ≥ m + r + 1, where m = 7. r = 3 gives 8 ≥ 11, which fails, and r = 4 gives 16 ≥ 12, which works. So 4 parity bits are needed.
Previous: How many usable host addresses does the network 10.0.0.0/21 provide? · Next: A TCP sender has a congestion window of 16 MSS, with the whole window in…
Practise computer networks
Try a fresh set of computer networks questions with an explanation after every answer, free and without signing up: Computer Networks practice. Or sit a full placement mock test.
More computer networks questions
- CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is the…
- In a stop-and-wait protocol, transmitting one frame takes 1 ms and the one-way…
- How many usable host addresses does the network 10.0.0.0/21 provide?
- A TCP sender has a congestion window of 16 MSS, with the whole window in…
- What is the main job of DNS (Domain Name System)?
- What is the default port number of SMTP, the protocol used to send email…
- Which OSI layer is responsible for data representation tasks such as…
- Which protocol automatically assigns an IP address, subnet mask and default…
- How many bits long is an IPv6 address?
- What is the subnet mask, in dotted-decimal form, for a /28 prefix?
More technical & programming practice
Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming · Java · Python · Data Structures
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge