HW #12
5. How many bits are required to address a 4M x 16 main memory if (29
a) Main memory is byte-addressable? g 3 m (X
b) Main memory is word-addressable? 13 x 2" a 123
(a?
8. Suppose we have 4 memory modules instead of 8 in Figures 4 6 and 4 7 Draw th

HW #11
55. A sequential circuit has one flip<flop; two inputs X and Y; and one output, S. It consists of a
full-adder circuit connected to 3 JK flip-flop, as shown below. Fill in the characteristic table
for this sequential circuit by completing the Next

HW #6
SHOW ALL WORK
44. Using arithmetic shifting, perform the following:
a) double the value 000101012 b) quadruple the value 011101112 c) divide the value 110010102
in half
il|ol"o
A lioolbl @
47. Assume we are using the simple model for floating-point

1. Trace this program:
100
101
102
103
104
105
106
107
108
109
10A
10B
10C
10D
10E
10F
110
111
When this program terminates, what values will be in:
~
~
~
~
F1U<13> N
Load
Subt
Store
Add
Store
JumpI
Subt
Store
AddI
Subt
Store
Jump
Halt
Hex
Hex
Hex
Hex
Hex

w many inputs does a decoder have if it has 64 outputs?
~ l J
3. 40. How many control lines does a multiplexer have if it has 32 inputs?
lit:Y logg'/ WU)
l.t.K '
4. 47. Little Susie is trying to train her new puppy. She is trying to figure out when the pu

HW #4 Computer Architecture
Chapter 2. o\
1. (16 -17) Represent the following decimal numbers in binary using 8-bit signed magnitude, one's
l1? 643!1 9
lO| 39
complement, and two's complement:
a) 119 b) 107 c)60 d) -20
b 0\ -m
A3I|l|oc>l Q'OQlO\ooc-om~ C

HW #8 - Chapter 3 Most of these questions have a similar version whose answer is found in the back of
the book. Use those to insure that you are doing anese correctly. (15 points)
@Question 2. Construct a truth table for the following:
8) XVZ + X(Y2)' + X

HW #5
43. Perform the following binary multi
plications using Booths algorithm, assuming signed twos
complement integers:
~ [oil
a) 1011 b)0011 lugl/ c) 1011 ole?
91019. x 10110 X 1100 5100
,otot WI'I/o/ oooo
IO/IO 000000 (9000
polo/00 MOI] 0'0 -
M "0 o

f
/o[p
3'0!
00H
HW #5
43. Perform the following binary multiplications using Booths algorithm, assuming signed twos
complement integers:
a) 1011
x 01010
HIGH!)
lcola/00
i0l|00
M
ill00l|l
b)0011LLQI/c)1o11
X10110 x1100
'I'lll'I/OI 00 00
000000 0000
Wall

HW #10
1. (30. 4e) Draw a half adder using only NAND gates.
(3 points)
i a '30 Av)
>'
H3733
\ i
LAW",
2. (35. 4e) Draw the combinational circuit that directly implements the Boolean
expression: (3 points)
/
F(x,y,z) = (x(y XOR z) + (xz)'
3. (36 Be) A co