Page 1 of 9

School of Computer Science

60-265-01 Computer Architecture and Digital Design
Winter 2010

Midterm Examination # 1
Wednesday, February 10, 2010

SAMPLE ANSWERS

Student Name: ________________ ___________________

First Name Family Name

Student ID Number: _____________________

Duration of examination: 75 minutes

1. Answer all questions on this examination paper in the space provided.

2. This is a closed-book examination – no notes or books or electronic
computing or storage devices may be used.
3. Do not copy from other students or communicate in any way. All
questions will be answered only by the attending proctors.
4. All students must remain seated during the last 5 minutes of the
examination.
5. The examination must be surrendered immediately when the instructor
announces the end of the test period.
6. Each student must sign the examination list before leaving the
classroom.

Total mark obtained: ____________________

Maximum mark: 42
 Page 2 of 9

Question 1. [ 6 marks ]
Using Boolean algebra, prove the following theorems. For each step in the proofs state
the specific axiom that is used. Each part is worth 3 marks. [NOTE: The full list of all
axioms is provided for each student on the last page of this examination.]

(a) X+X = X

Proof:

X+X = (X+X)1 Identity

= (X+X)(X+X’) Complementation

= X+(XX’) Distributivity

= X+0 Complementation

= X Identity

(b) X’ + XY = X’ + Y

Proof:

Collapse Theorem (see lecture notes)

X’ + XY = (X’ + X).(X’ + Y) Distributivity

= 1.(X’ + Y) Complementation

= X’ + Y Identity
 Page 3 of 9

Question 2. [ 13 marks ]
Answer each question below.

A. Convert the decimal number -271 to a signed-binary number using a 16-bit

representation of 2’s complement form of integer. [ 3 marks ]

Start by converting the absolute value:

271 / 2 = 135 rem 1 least significant (rightmost) bit
135 / 2 = 67 rem 1
67 / 2 = 33 rem 1
33 / 2 = 16 rem 1
16 / 2 = 8 rem 0
8 / 2 = 4 rem 0
4 / 2 = 2 rem 0
2 / 2 = 1 rem 0
1 / 2 = 0 rem 1 most significant (leftmost) bit

Gathering bits yields the 9-bit result: 100001111

Now convert to 16-bit signed binary form. First add seven

0-bits (‘padding bits’) to the left side.

0000000100001111 Padded absolute value

1111111011110000 Complement
1111111011110001 Add 1 – Final answer

B. Convert the octal number 4136758 to a hexadecimal number. [ 2 marks ]

Write octal digits as binary – groups of 3 bits per octal

digit
= 100 001 011 110 111 101

Rearrange bits (from right) in groups of 4 bits and pad with

zeros on the left, as required
= 0010 0001 0111 1011 1101

Convert each 4-bit group to a hex-digit

Answer: = 217BD
 Page 4 of 9

C. Convert the positive decimal real number 1.1 to an unsigned binary number. [ 2
marks ]

Separate the number 1.1 into its integer and fractional

parts and convert each separately. First, convert the
integer:

1 / 2 = 0 rem 1  1

Next, convert the fraction:

0.1 x 2 = 0.2 integer 0

0.2 x 2 = 0.4 integer 0
0.4 x 2 = 0.8 integer 0
0.8 x 2 = 1.6 integer 1
0.6 x 2 = 1.2 integer 1
0.2 x 2 = 0.4 integer 0 Repeats the last 4 steps
Answer:  0.0[0011]
Where the bits within braces repeat.

D. Convert the positive decimal real number 4.375 to an unsigned binary number. [ 2
marks ]

Separate the number 4.375 into its integer and

fractional parts and convert each separately. First,
convert the integer:

4 / 2 = 2 rem 0
2 / 2 = 1 rem 0
1 / 2 = 0 rem 1  100

Next, convert the fraction:

0.375 x 2 = 0.75 integer 0

0.75 x 2 = 1.5 integer 1
0.5 x 2 = 1.0 integer 1
Stop here because fraction part is ZERO!
Answer:  0.011
Note that this value is just 3/8 which, of course, is
0.375 expressed as a rational number.
 Page 5 of 9

E. State the exact values of the largest positive value and the smallest negative value
that can be defined in an L-bit representation using signed-binary (ie. 2’s
complement) notation. [ 2 marks ]

Largest positive value: 2L-1 - 1

Smallest negative value: -2L-1

F. State the exact number of different (ie. unique) bit arrangements that can be
represented in an L-bit representation. [ 1 mark ]

Number of unique bit arrangements in L bits: 2L

G. State the 16-bit BCD representation of the number 691810 in binary form (ie. as 16
bits). [ 1 mark ]

Answer: 691810 = 0110 1001 0001 1000

 Page 6 of 9

Question 3. [ 9 marks ]

Part A. State the six (6) fundamental logic gates (excluding the inverter) and, for each
gate, provide a complete truth table that fully defines the logic of each gate. Each
correctly identified gate and truth table is worth 1 mark. [6 marks]

AND OR
X/Y 0 1 X/Y 0 1
0 0 0 0 0 1
1 0 1 1 1 1

NAND NOR
X/Y 0 1 X/Y 0 1
0 1 1 0 1 0
1 1 0 1 0 0

XOR XNOR
X/Y 0 1 X/Y 0 1
0 0 1 0 1 0
1 1 0 1 0 1

Part B. State the five (5) principal components of the von Neuman architecture for a
stored program digital computer. [ 3 marks ]

RAM – volatile memory

CPU – central processing unit
Bus – interconnection network (connects all other components)
Mass storage – non-volatile storage
I/O – peripheral devices for user input/output
 Page 7 of 9

Question 4. [ 8 marks ]
Answer all parts of this question. In each part you may use only Boolean algebra and
fundamental postulates – truth tables are not permitted.

Part A. Simplify the following Boolean expression using Boolean algebra (no truth
tables or Karnaugh maps). Express your answer in both SOP and POS forms. [3 marks]

A’BC + ABC’ + ABC

ANSWER:
A’BC + ABC’ + ABC = (A’+A)BC + AB(C’+C)

= BC + AB

Final Answer: = BC + AB (SOP), B(A+C) (POS)

Part B. Simplify the following Boolean expression using Boolean algebra. [2 marks]

(BC’ + A’D)(AB’ + CD’)

ANSWER:
(BC’ + A’D)(AB’ + CD’)

= BC’AB’ + BC’CD’ + A’DAB’ + A’DCD’

(BC’AB’=ABB’C’=0, same way BC’CD’=0,... )

= 0 + 0 + 0 + 0

= 0 Final Answer

Part C. Using De Morgan’s theorem and Boolean algebra, show that: [3 marks]

(AB)’+(A’B’)’ = 1

ANSWER:
(AB)’+(A’B’)’

= (A’+B’)+(A’’+B’’) = A’+B’+A+B = 1+1 = 1

 Page 8 of 9

Question 5. [ 6 marks ]

Part A. [ 3 marks ]
Simplify the following Boolean SOP expression using the Karnaugh map technique.
Express your answer in SOP form.

F(X,Y,Z) = ∑ m(0,2,5,6)

ANSWER:

Kmap YZ/00 01 11 10
X/0 1 0 0 1
1 0 1 0 1

The resulting SOP form is:

F = X’Z’ + XY’Z + YZ’

Part B. [ 3 marks ]
Simplify the following Boolean SOP expression, with don’t care conditions, using the
Karnaugh map technique. Express your answer in SOP form.

F(W,X,Y,Z) = ∑ m(0,2,5,6,8,12)

dc(W,X,Y,Z) = ∑ m(1,4,10,15)

ANSWER: (D is used for don’t care values)

Kmap YZ/00 01 11 10
WX/00 1 D 0 1
01 D 1 0 1
11 1 0 D 0
10 1 0 0 D

NOTE: Remember the D values can be chosen arbitrarily.

The resulting SOP form is:

F = Y’Z’ + W’Y’ + W’Z’

 Page 9 of 9

This page contains information provided freely for each student to use for the
examination, if required. You may detach this page.

Boolean Postulates:

P0: Existence: There exist at least two elements x,y in B such

that x ≠ y

P1: Closure: For every x,y in B there exist two combinational

operators + and . where (x+y) is in B and (x.y) is in B

P2: Identity: There exist identity elements 0,1 in B relative to

the operations + and ., such that for every x in B:

0+x = x+0 = x and 1.x = x.1 = x.

P3: Commutativity: The operations + and . are commutative for

all x,y in B:

x+y = y+x and x.y = y.x

P4: Distributivity: Each operation + and . is distributive over

the other; that is, for all x,y,z in B:

x.(y+z) = x.y+x.Z and x+(y.z) = (x+y).(x+z)

P5: Complementation: For every element x in B there exists an

element ~x, called the complement of x, satisfying:

x+~x = 1 and x.~x = 0