Convert each of the following base 10 representations to its equivalent two’s co

Question

Convert each of the following base 10 representations to its equivalent two’s complement representation in which each value is represented in 8 bits:

13

13

1

0

16

The following message was originally transmitted with odd parity in each short bit string. In which strings have errors definitely occurred?

11000      11010      10111      00000      11101      11001      10101      00100      01110

Express each of the following values in binary notation:

a. 5 3/4
b. 15 15/16
c. 5 3/8
d. 1 1/4
e. 6 5/8

Express the values of the following binary sequence in hexadecimal notation

01010100 01101000 01100101 00100000 01110100 01101111 01110100 01100001
01101100 00100000 01100011 01101111 01110011 01110100 00100000 01101001
01110011 00100000 00100100 00110111 00101110 00110010 00110101 00101110

Encode the following sentences in ASCII using one byte per character.

a. Does 70/5 = 14?

b. The total cost is $6.98

If each sector on a magnetic disk contains 1024 bytes, how many sectors are required to store two pages of text (each page is 50 lines and 100 characters per line) in a foreign language if each character is represented in two bytes of Unicode?If each sector on a magnetic disk contains 1024 bytes, how many sectors are required to store two pages of text (each page is 50 lines and 100 characters per line) in a foreign language if each character is represented in two bytes of Unicode?

Explanation / Answer

To find the 2's complement of a number you:

1) 13 : In 8-bit representation ,First bit from left is 0 since it is a positive number.

13 : 0 0 0 0 1 1 0 1

Inverted bits : 1 1 1 1 0 0 1 0 + 1 = 1 1 1 1 0 0 1 1

2) -13 : In 8-bit representation ,First bit from left is 1 since it is a positive number.

-13 : 1 0 0 0 1 1 0 1

Inverted bits : 0 1 1 1 0 0 1 0 + 1 = 0 1 1 1 0 0 1 1

3) -1 : In 8-bit representation ,First bit from left is 0 since it is a positive number.

-1 : 0 0 0 0 0 0 0 1

Inverted bits : 1 1 1 1 1 1 1 0 + 1 = 1 1 1 1 1 1 1 1

4) 0 : In 8-bit representation

0 : 0 0 0 0 0 0 0 0

Inverted bits : 1 1 1 1 1 1 1 1 + 1 = 1 0 0 0 0 0 0 0 0

5) 16 : In 8-bit representation

16 : 0 0 0 0 1 0 0 0

Inverted bits : 1 1 1 1 0 1 1 1 + 1 = 0 0 0 0 1 0 0 0

*(Chegg policy doesn't allow multiple questions in one thread)

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.