0% found this document useful (0 votes)
5 views4 pages

Digital Logic Tutorial for Computer Architecture

This document outlines a tutorial for a computer architecture course focusing on digital logic. It includes tasks such as writing output expressions for circuits, implementing logic expressions, proving identities, deriving standard forms, and minimizing Boolean expressions using Karnaugh maps. Additionally, it covers practical applications like designing circuits for an air-conditioner and a half-adder.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views4 pages

Digital Logic Tutorial for Computer Architecture

This document outlines a tutorial for a computer architecture course focusing on digital logic. It includes tasks such as writing output expressions for circuits, implementing logic expressions, proving identities, deriving standard forms, and minimizing Boolean expressions using Karnaugh maps. Additionally, it covers practical applications like designing circuits for an air-conditioner and a half-adder.
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

SOF108 COMPUTER ARCHITECTURE

SESSION: September 2025

TUTORIAL 3: Digital Logic

1. Write the output expression for each circuit as it appears in the below figures.

2. Implement the following logic expressions using AND gates, OR gates and inverters

a)
as needed.
𝑌 = 𝐴̅𝐵̅ + 𝐵(𝐴
b)
+ 𝐶)
𝑌 = (𝐴 +using 𝐵)(𝐶 ̅+
𝐷)
3. Prove the followings a truth table and algebraically. You may use the table
from the lecture slide.
a) ̅𝑥̅𝑦̅𝑧̅ = 𝑥̅ + 𝑦̅ + 𝑧
b)
𝑎𝑏̅ 𝑐 + 𝑎𝑏𝑐 + 𝑎̅𝑏𝑐 + 𝑎𝑏𝑐 = 𝑎𝑐 + 𝑏𝑐
c)
(𝐴̅ + 𝐶)(𝐴 + 𝐷̅ )(𝐵 + 𝐶̅ + 𝐷) = 𝐴𝐵𝐶 + 𝐴̅𝐶̅ 𝐷̅

+ 𝐴̅𝐵𝐷̅ + 𝐴𝐶𝐷
4. Derive the SOP and POS expressions for the following truth tables (F:
output). a)
A B C F
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 0
b)
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

5. Build the truth table for the Boolean expression : 𝑍 = 𝐴(𝐵 + 𝐶𝐷). From the
truth table determine the standard SOP and POS expressions.

6. Write the algebraic expressions in terms of the inputs from the following logic
circuits to prove the output of the circuits.

7. Apply DeMorgan’s theorems to each of the following expressions:


a) (̅𝐴̅̅̅+̅̅̅𝐵̅+̅̅̅𝐶̅)̅𝐷̅
b) ̅𝐴̅𝐵̅𝐶̅̅̅+̅̅̅𝐷̅𝐸̅𝐹̅
c) ̅𝐴̅𝐵̅+ ̅ ̅̅̅𝐶̅̅ 𝐷̅̅̅+̅̅̅𝐸̅𝐹̅

8. Convert the following Boolean expressions into standard SOP (Question a) and
standard POS (Question b) form:
𝐴̅ 𝐵̅ + 𝐴𝐵𝐶̅𝐷
a)

(𝐴 + 𝐵̅ + 𝐶)(𝐵̅ + 𝐶
b)

+ 𝐷̅ )
9. Minimize the followings using Karnaugh Map.
a) 𝐴𝐵̅ 𝐶 + 𝐴̅𝐵𝐶 + 𝐴̅𝐵̅ 𝐶 + 𝐴̅ 𝐵̅ 𝐶̅ + 𝐴𝐵̅ 𝐶
b) 𝑓(𝐴, 𝐵, 𝐶, 𝐷) = 𝐴̅𝐵̅ 𝐶̅ 𝐷̅ + 𝐴̅ 𝐵̅ 𝐶𝐷̅ + 𝐴̅ 𝐵̅ 𝐶𝐷 + 𝐴̅𝐵𝐶̅𝐷
c) +
𝑍 𝐴
=̅𝐵𝑓𝐶𝐷
(𝐴,̅ +
𝐵, 𝐴
𝐶̅𝐵
) 𝐶𝐷 +̅ 𝐶̅ + 𝐴̅𝐵
= 𝐴̅ 𝐵
𝐴𝐵
+ ̅ 𝐶̅ 𝐷̅ ̅ +
𝐴𝐵𝐶 + 𝐴𝐶
𝐴𝐵̅ 𝐶 ̅ 𝐷
d)

𝑍 followings
= 𝑓(𝐴, 𝐵, 𝐶) Karnaugh
= 𝐴̅𝐵 +Map.
𝐵𝐶̅ +
a) (𝐴 +𝐵𝐶 +𝐶
𝐴𝐵)(𝐴̅ 𝐶
10. Minimize the using
𝐵+ + 𝐵̅ + 𝐶)(𝐴̅ + 𝐵̅ + 𝐶)(𝐴̅ + 𝐵 + 𝐶̅)
b) (𝐴 + 𝐵 + 𝐶)(𝐴 + 𝐵 + 𝐶̅)(𝐴 + 𝐵̅ + 𝐶)(𝐴 + 𝐵̅ + 𝐶̅)(𝐴̅ + 𝐵̅ + 𝐶)

11. Use a K map to simplify 𝑦 = 𝐶̅ (𝐴̅𝐵̅ 𝐷̅ + 𝐷̅ ) + 𝐴𝐵̅ 𝐶 + 𝐷̅ .

12. Consider the two K-map groupings in the below figure. Is one better than the other?

13. An air-conditioner in an office will be turned on if:


 on working days, the temperature rises above 28°C
 the relative humidity rises above 90% during office hours
 the relative humidity rises above 90% after office hour
 on working days, the air-conditioner will be turned on if at any time, both the
temperature goes above 28°C and the relative humidity goes above 90%
during holidays, the air-conditioner can only be turned on with a
switch Let W = working days, H = office hours, T = temperature above 28°C,
R = relative humidity above 90%, S = switch on, A = air-conditioner on.
Write an expression relating A with the input variables. Simplify it and implement it with
AND, OR and NOT gates.
14. XMUM announces a new crash course on Digital Logic Design. A student can take
the course if only the following conditions are satisfied:
 Completed at least 60 credit hour and Engineering student with good results.
 Completed at least 60 credit hour, an engineering student and has departmental
permission.
 Completed less than 60 credit hour and engineering student with bad results
 Good results and has departmental permission
 Engineering student with no departmental approval
Write a Boolean expression that represents this scenario. Simplify the expression using
K- map. What is your observation from the simplification?

15. A half adder takes the input of two binary digits, adds them and produces two
outputs: sum and carry. The figure below depicts the main idea of a half adder.

Write a Boolean expression to represent the outputs of the half-adder. Based on your
Boolean expression design a half-adder circuit using XOR and AND gate.

You might also like