BME303 Spring 2007
Homework 2
Due 2/13/2007
Last Name:
Kanungo
First Name:
Anil
.
Instructions:
1.
Each homework must be stapled [50 points are deducted otherwise].
2.
The first page of the homework must have a completed heading as above (it can be hand
written).
3.
Show your work, except in the most obvious cases where the calculations can be done
mentally.
4.
Your work must be neat and clear.
Note: These instructions apply to all the assignments this semester.
Problem 1 [4 + 2 = 6]
a)
You have a 4 bit computer, i.e. a computer that can only do 4 bit binary arithmetic and
everything beyond the 4
th
bit cannot be represented. Complete the following addition
table where you add the binary number in the i
th
column with the j
th
row. The numbers are
represented using 2’s complement format. An example is given to get you started.
0011
1110
0110
1010
0001
0100
1111
0111
1011
0011
0110
0001
1001
1101
0111
1010
0101
1101
0001
1111
0010
1101
0101
1001
b)
Is there an overflow in some additions (circle if any)
[shaded instead to indicate overflow]
Problem 2 [2+2+2+2 = 8]
In the following table, the 1
st
column represents a bit pattern on an 8 bit computer (i.e. anything
beyond 8 bits is not represented).
Column A: Write the 1’s complement of the initial bit
pattern.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 Ren
 Binary numeral system

Click to edit the document details