Scribd
Upload
45 views

Tutorial 3 Answers

This document contains answers to a tutorial on digital logic and computer organization. It includes simplifying Boolean expressions, writing Boolean equations from logic circuits, creating truth tables, and reworking equations using Boolean identities and theorems. Key concepts covered are how any logic circuit can be implemented using only NAND or NOR gates but not AND gates alone.

Uploaded by

M Arif Siddiqui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Tutorial 3 Answers

This document contains answers to a tutorial on digital logic and computer organization. It includes simplifying Boolean expressions, writing Boolean equations from logic circuits, creating truth tables, and reworking equations using Boolean identities and theorems. Key concepts covered are how any logic circuit can be implemented using only NAND or NOR gates but not AND gates alone.

Uploaded by

M Arif Siddiqui
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ITDR2102: Computer Organization – Tutorial Answers

Tutorial 3
From Lecture 3 (Digital Logic)

1. Simplify the follow expression algebraically:


𝐅 = 𝐀. 𝐁. 𝐂 + 𝐀. 𝐁. 𝐂 + 𝐀. 𝐁. 𝐂 + 𝐀. 𝐁. 𝐂
Answer:
𝐅 = 𝐀. 𝐁 . (𝐂 + 𝐂) + 𝐀. 𝐁. (𝐂 + 𝐂)
𝐅 = 𝐀. 𝐁 + 𝐀. 𝐁
𝐅 = (𝐀 + 𝐀). 𝐁
𝐅=𝐁
2. Write the Boolean equation directly from the following circuit.

Answer:
𝐙=𝐄+𝐁
𝐙 = 𝐃. 𝐂 + 𝐁
𝐙 = (𝐀 + 𝐁 + 𝐂). 𝐂 + 𝐁
3. Create the truth table for the circuit above.

Answer:
A B C C D=A+B+C 𝐄 = 𝐂. 𝐃 E+B 𝐙 = (𝐄 + 𝐁)
0 0 0 1 0 0 0 1
0 0 1 0 1 0 0 1
0 1 0 1 1 1 1 0
0 1 1 0 1 0 1 0
1 0 0 1 1 1 1 0
1 0 1 0 1 0 0 1
1 1 0 1 1 1 1 0
1 1 1 0 1 0 1 0

4. Write the Boolean equation from the truth table.

Answer:

𝐙 = 𝐀. 𝐁. 𝐂 + 𝐀. 𝐁. 𝐂 + 𝐀. 𝐁. 𝐂
Page 1
ITDR2102: Computer Organization – Tutorial Answers

5. Consider the following equation.

𝐙 = 𝐀.𝐂 + 𝐁
6. Create a truth table from the above Z equation. Does the truth table match the answer from
question 3?

Answer:
A B C C A.C A.C+B 𝐙 = 𝐀. 𝐂 + 𝐁
0 0 0 1 0 0 1
0 0 1 0 0 0 1
0 1 0 1 0 1 0
0 1 1 0 0 1 0
1 0 0 1 1 1 0
1 0 1 0 0 0 1
1 1 0 1 1 1 0
1 1 1 0 0 1 0

7. Try to rework equation from question 2 using the boolean theorems, identities, and laws to get
it close to equation from question 4. NOTE: You will probably not get it to match exactly.
To do so would involve quite a bit foresight, intuition, and sleights of hand.

Answer:
Z=((A+B+C).C)+B
Z=A.C+B.C+C.C+B Using distribute proposition
Z=A.C+B.C+0+B Using identity proposition
Z=A.C+B.C+B
Z=A.C+B.C+B B.C+B=B Using simplification theorem
Z=A.C+B

8. Answer by true or false for each of the following statements:

a. Any logical circuit could be converted to use NAND gates only. [TRUE]

b. Any logical circuit could be converted to use NOR gates only. [TRUE]

c. Any logical circuit could be converted to use AND gates only. [FALSE]

Check the answers in L03 – Slide 17

Page 2

You might also like