Scribd
Upload
63 views

Review Worksheet Part 1: Unsigned 8-Bit Arithmetic: Girum Ibssa

The document is a review worksheet for unsigned and signed 8-bit binary arithmetic. It contains questions about converting between binary and decimal numbers, the value ranges for unsigned and two's complement signed numbers, and algorithms to check if a sum is out of range. Sample addition problems are provided for unsigned and signed numbers that result in overflow. Hexadecimal conversions are also included.

Uploaded by

girum043
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
63 views

Review Worksheet Part 1: Unsigned 8-Bit Arithmetic: Girum Ibssa

The document is a review worksheet for unsigned and signed 8-bit binary arithmetic. It contains questions about converting between binary and decimal numbers, the value ranges for unsigned and two's complement signed numbers, and algorithms to check if a sum is out of range. Sample addition problems are provided for unsigned and signed numbers that result in overflow. Hexadecimal conversions are also included.

Uploaded by

girum043
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Name: ______________________

Girum Ibssa

Review Worksheet

Part 1: Unsigned 8-bit arithmetic

For unsigned, 8-bit numbers, what is the value (in decimal) of each of the following numbers:

00000000 ______
0 12
00001100 ______
11111111 ______
255 16
00010000 ______
128
10000000 ______

For unsigned numbers, what is the range of values that can fit in 8 bits?

binary decimal
00000000
Min: _____________ _________________
0
11111111
Max: _____________ 255
_________________

In binary arithmetic, an unsigned operation whose result does not lie in this range produces a carry.
The range 0 through (2^n) - 1, where n is the number of bits.
Write two numbers within the range that, if added, result in a number outside of the range. (Write the same
numbers in decimal as well as binary - truncate the binary sum to 8 bits, write the truncation of the binary
answer in decimal.)

binary decimal

11111101
______ 253
_______

00000011
+ ______ 3
+ _______

[1]00000001
______ [255] +1
_______

What is a general algorithm that could be used to determine if the sum of two unsigned numbers is out of
range?
Just check to see if the carry bit was tripped.
Part 2: Signed 2's Compliment 8-bit arithmetic

For signed, 8-bit numbers, what is the value (in decimal) of each of the following 2's complement binary
numbers:

0
00000000 ______ 28
00011100 ______
11111111 ______
-1 20
00010100 ______
-128
10000000 ______

For 2's complement signed numbers, what is the range of values that can fit in 8 bits?

binary decimal
10000000
Min: _____________ -128
_________________
01111111
Max: _____________ 127
_________________

In binary arithmetic, a signed operation whose result does not lie in this range produces an overflow.
The range -(2^n)/2 through [(2^n)/2] - 1, where n is the number of bits.
Write two negative numbers within the range that, if added, result in a number outside of the range. (Write
the same numbers in decimal as well as binary - truncate the binary sum to 8 bits, write the truncation of the
binary answer in decimal.)

binary decimal

11111111
______ -1
_______
10000000
+ ______ + _______
-128

01111111
______ 127!
_______

(1 pts) Part 3: Hexadecimal

Translate the following values into hexadecimal:

00hex
00000000 ______ 00001011 0Bhex
______
FFhex
11111111 ______ 00010001 ______
11hex
88hex
10001000 ______

What is a general algorithm that could be used to determine if the sum of two signed numbers is out of
range?
Check if the carry bit has been tripped.

Last updated 3/28/11

You might also like