COMPUTER ARCHITECTURE AND ORGANIZATION

Clearly show your working to avoid losing marks.

QUESTION ONE
(a) Derive the Boolean function that implements the circuit and simplify:

[10]
(b) Using the laws and postulates of Boolean algebra, simplify the Boolean
expressions below:

(i) BD A + CC A
[4]

(ii) DC C + A B [4]

(iii) DC + C + B [4]

(iv) A + AB
[4]

(c) Write and Simplify the Boolean expressions for the following functions:

i. [8]
 A B C F
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0

ii. F(𝐴, 𝐵, 𝐶) = ∑(2, 3, 4, )

[8]

iii. F(𝐴, 𝐵, 𝐶, D) = ∑(1, 4 , 5)

[10]

(d) Define the following Boolean laws/properties.

(i) Commutative law [2]
(ii) Distributive Law [2]
(iii) Associative Law [2]
(iv) Complement Law [2]
(v) Identity Law [2]

QUESTION TWO
(a) Explain how the following logic gates works and draw their respective
logic circuits:

(i) OR gate [6]

(ii) NOT gate [6]

(iii) AND gate [6]

(iv) NOR gate [6]

(b) Given the Boolean function below, draw the logic circuit that implements
this function:
(i) F = BC + B(A + C) [7]
(ii) F = B + D(A + C) [7]