FACULTY OF SCIENCE AND TECHNOLOGY

COMPUTER ARCHITECTURE & ORGANIZATION BCS 111

TEST 2
1. (a) Use the ASCII chart to decode:
(i) The words VU is best to Hexadecimal. (3 Marks)

(ii) The Binary string below to text.

100011010100111010100010000010000101101111 1111001
(3 Marks)
(b) (i) Convert the following INFIX expression to POSTFIX
((a + b) (a – b)) /(x + y) (3 Marks)

(ii) Convert the following POSTFIX expression to INFIX.

pqv+*ab–ab+/- (3 Marks)

2. (a) Draw a Logical Diagram corresponding to the expression

X = C(A + B) + D (3 Marks)

(b) Prove that (A + B) (A + C) =A + BC (3 Marks)

__ _ _
(c) Use Boolean Algebra to simplify: ABC + ABC + ABC + ABC (3 Marks)

3. (a) Identify the miniterms and the maxiterms from the following terms
_ _
(ABC), (A + B), (A + C), (BC), (ACB), (A+B+C) (3 Marks)

(b) Assume a Karnaugh Map described by the expression F(A, B, C) = Σ(1, 4, 5, 7).
(i) Derive a corresponding Truth Table (3 Marks)
(ii) Generate the corresponding SUM OF PRODUCTS expression (3 Marks)
(iii) Generate the corresponding PRODUCT OF SUMS Expression (3 Marks)
(iv) Simplify the expression using a Karnaugh Map method (3 Marks)
(v) Draw a corresponding Logical diagram (3 Marks)
(vi) Simplify the expression again assuming now that there are some DON’T CARE
cases described by the expression d(A, B, C) = Σ(2, 3) (3 Marks)
(vii) Draw a Logical diagram corresponding to the new simplified expression. (3
Marks)

4. (a) How many control lines would you need to design a 6-1 multiplexer? (2 Marks)
(b) Draw a logical diagram for a 1 – 3 demultiplexer. (3 Marks)

[Type here] 10-02-2024