College of Computer Engineering & Science
Assignment # 2 Due Date: 01-08-2023
Hamming code is a popular algorithm used in several applications including communication networks, DRAM, and external storage to detect up to two-bit errors and correct one-bit-errors. In this assignment, you are required to do the followings.
Section A:
Convert the Second letter (lower case) of your name into an 8-bit ASCII binary number. This is your data set for this section.
Using the Hamming algorithm, determine the value of the check bits that would be stored in memory along with the data set. Show how you got your answer. Also append the check bits @ appropriate positions in your data set. By now, you should have a 12-bit long data word.
Flip only anyone of the data bit in your data word ( step b) and recalculate the check bits.
Calculate the syndrome bits and explain how will you interpret the syndrome word for error location.
Present your work in a tabular format same as (chapter # 5 Figure 5.10 -Page 179) of your course book (10th edition).
Section B:
Convert the Third letter (Upper case) of your surname into an 8-bit ASCII binary number. This is your data set for this section.
Using the Hamming algorithm, determine the value of the check bits that would be stored in memory along with the data set. Show how you got your answer. Also append the check bits @ appropriate positions in your data set. By now, you should have a 12-bit long data word.
Flip only anyone of the check bit in your data word (step b) and recalculate the check bits.
Calculate the syndrome bits and explain how will you interpret the syndrome word for error location.
Present your work in a tabular format same as (chapter # 5 Figure 5.10 -Page 179) of your course book (10th edition).
Note: A pre reading (Chapter 5: pages 176-179) can be beneficial for these tasks.
The post College of Computer Engineering & Science Assignment # 2 Due Date: 01-08-2023 appeared first on essayfab.
The post College of Computer Engineering & Science Assignment # 2 Due Date: 01-08-2023 appeared first on GET HELP WITH PAPERLINQ.