ZuoTi.Pro
Question

5-Given that the ASCII code for A is 1000001, what is the ASCII code for J?...

5-Given that the ASCII code for A is 1000001, what is the ASCII code for J? Express the answer as 7 binary digits.

6- Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7. We have already calculated that we need 4 check bits, and the length of all code words will be 11. Code words are created according to the Hamming algorithm presented in the text. We now receive the following code word: 011100101 Assuming even parity, according to our error-correcting code, in what bit is the error? Number the bits from the right starting at 1. If there is no error, enter 0.

7- Find the quotient for the following division problem modulo 2. 10011112 ÷ 11012

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
5-Given that the ASCII code for A is 1000001, what is the ASCII code for J?...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 6. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected...

    6. Suppose we want an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 10. a) How many parity bits are necessary? b) Assuming we are using the Hamming algorithm presented in this chapter to design our error-correcting code, find the code word to represent the 10-bit information word: 1001100110

  • Instruction: For every question you answer, please show the calculation steps, if you do not show...

    Instruction: For every question you answer, please show the calculation steps, if you do not show the calculation step and show only the final result, you will not receive any score. You can use online resources for conversion, if the conversion is not a part of the question. There are a total of eight questions. Question 5: Suppose we are working with an error-correcting code that will allow all single-bit errors to be corrected for memory words of length 7....

  • Soru 7 The ASCII code has 128 binary-coded characters. If a computer generates 125,000 characters per...

    Soru 7 The ASCII code has 128 binary-coded characters. If a computer generates 125,000 characters per second, determine the following: a) The number of bits (binary digits) required per character. b) The number of bits per second required to transmit the computer output, and the minimum bandwidth (Nyquist frequency) required to transmit this signal. c) For single error detection capability, an additional bit (called a parity bit) is added to the code for each character. Calculate your answers for part...

  • 5) (2 pt) A 12-bit Hamming code word containing 8 bits of data and 4 parity bits is read from memory. What was the orig...

    5) (2 pt) A 12-bit Hamming code word containing 8 bits of data and 4 parity bits is read from memory. What was the original 8-bit data word that was written into memory if the 12-bit word read out is 010011111000? Show your work. 5) (2 pt) A 12-bit Hamming code word containing 8 bits of data and 4 parity bits is read from memory. What was the original 8-bit data word that was written into memory if the 12-bit...

  • e) Consider a SEC (Single Error Correcting) code that protect 8 bit words with 4 parity...

    e) Consider a SEC (Single Error Correcting) code that protect 8 bit words with 4 parity bits. If we read the value 375H, is there an error? If so, correct the error. Problem

  • Q3. In a (7,4) Hamming Code, three parity bits p1, p2, p3 are added to four...

    Q3. In a (7,4) Hamming Code, three parity bits p1, p2, p3 are added to four data bits dl, d2, d3, and d4, and the coverage of each parity bit is as shown in the table below: Bit position 2 3 4 5 6 7 Encoded data bits p1 p2 di p3 d2 d3 d4 da X p1 X X X x Parity bit coverage p2 х X X p3 X X X х 1) (3 pts) Assume even parity...

  • A Hamming code is a technique where errors can not only be detected but can also...

    A Hamming code is a technique where errors can not only be detected but can also be corrected. The simplest example of this kind of code is the (7,4)-Hamming code. In this scheme, a codeword is 7 bits long. We number the positions as follows:                 1   2   3   4   5   6   7 The message that is sent is only four bits long, with these four bits occupying positions 3, 5, 6, and 7. Bits 1, 2, and 4 are...

  • All that is needed is to fill in that one area that says "Student provides missing...

    All that is needed is to fill in that one area that says "Student provides missing code to compare computed hammingCode[] bits to the codeword[] bits to determine the incorrect bit." in the code below. THAT IS ALL THAT IS NEEDED PLUS SCREENSHOT OF COMPILED OUTPUT AFTERWARDS. Please TAKE SCREENSHOT of the compiled output which should look similar to the sample one provided. //------------------------------------------------------ // Problem #6 // Problem6.c //------------------------------------------------------ #include <stdio.h> #include <stdlib.h> #include <stdbool.h> #include <string.h> #include <math.h>...

  • [Hamming algorithm] having problems understanding the step highlighted in bold. explain the part going over checking...

    [Hamming algorithm] having problems understanding the step highlighted in bold. explain the part going over checking the parity bits (the problem question is listed below) 12+1+r<=2^r-->r=5 5+12=17 for bit length--> -->parity bits check positions are 1,2,4,8,16-->fill in the using BIN skipping over the 1,2,4,8,16 positions--> --> 1=1 2=2 3=1+2 4=4 5=1+4 6=2+4 7=1+2+4 8=8 9=1+8 10=2+8 11=1+2+8 12=4+8 13=1+4+8 14=2+4+8 15=1+2+4+8 16=4+4+8 from my understanding, you check over the parity bits 1,2,4,8,16. using above as a reference. for bit 1...

  • Consider a binary communication channel transmitting coded words of n bits each. Assume that the probability...

    Consider a binary communication channel transmitting coded words of n bits each. Assume that the probability of successful transmission of a single bit is p (and the probability of an error is q=1-p), and that the code is capable of correcting up to e (where e>= 0) errors. If we assume that the transmission of successive bits is independent, then what is the probability of successful word transmission? Hint: the word is successfully transmitted if there are e or fewer...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT