Scribd
Upload
6 views3 pages

Week 3 Activity

The document outlines a week 3 activity focused on understanding Boolean algebra through truth tables, including constructing truth tables for given functions and verifying De Morgan's Theorems. It includes various parts that require students to simplify Boolean expressions, derive complements, and compare logic diagrams. Additionally, it poses discussion questions about the importance of Boolean algebra in digital circuits and the role of truth tables in simplification.

Uploaded by

retselisitsoemonyatsi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Week 3 Activity

The document outlines a week 3 activity focused on understanding Boolean algebra through truth tables, including constructing truth tables for given functions and verifying De Morgan's Theorems. It includes various parts that require students to simplify Boolean expressions, derive complements, and compare logic diagrams. Additionally, it poses discussion questions about the importance of Boolean algebra in digital circuits and the role of truth tables in simplification.

Uploaded by

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

Week 3 Activity

Activity: Understanding Boolean Algebra Through Truth Tables

Objective:

 To understand Boolean algebra operations using truth tables.

 To verify De Morgan’s Theorems.

 To simplify Boolean expressions.

Materials Needed:

 Pen and paper OR a spreadsheet software (Excel, Google Sheets).

Instructions:

Part 1: Constructing Truth Tables

1. Complete the Truth Table for the given Boolean function


Given: F(A, B, C) = A’B + BC

o Create a truth table with all possible values of A, B, and C.

o Compute intermediate columns (A’, B, BC) before finding F(A,


B, C).

Task: Fill in the missing values and find F(A, B, C).

Part 2: Verifying De Morgan’s Theorems

2. Verify De Morgan’s First Law:

o Fill in the truth table for (A.B)’ = A’ + B’


Task: Complete the truth table and verify if (A.B)’ = A’ + B’.

3. Verify De Morgan’s Second Law:

 Fill in the truth table for (A + B)’ = A’ . B’

Part 4: Using DeMorgan’s theorem, show that:

a. (A+B)’ (A’+B’)’ = 0
b. A + A’B + A’B’ = 1
Part5: Given the Boolean expression F = x’y + xyz’

a. Derive an algebraic expression for the complement F’.


b. Show that F.F’ = 0
c. Show that F + F’ = 1

Part 6: Given the Boolean function F = xy’z + x’y’z + xyz

a. List the truth table of the function


b. Draw the logic diagram using the original Boolean expression as
given in the question.
c. Simplify the algebraic expression using Boolean algebra
d. List the truth table of the function from the simplified expression
and show that it is the same as the truth table in part (a)
e. Draw the logic diagram from the simplified expression and compare
the total number of gates with the diagram of part (b)

Part 7 : Simplify the following expressions using Boolean algebra

1. F(A,B) = A + AB
2. F(A, B) = AB + AB’
3. F(A,B,C) = A’BC + AC
4. F(A,B,C) = A’B + ABC’ + ABC
5. F(X,Y) = X + XY
6. F(A) = A + AA’
7. F(A, B) = A (A + A’) + B
8. F(A, B) = (A+B) (A’+B) B’
9. F(A, B, C, D) = ( A+B’+C+D’)C
10. F(A.D,C) = (A+C) (AD+AD’) + AC + C
11. F = (A+B) (A+C)
12. F(A,B,C,D) = AB’ + C’D + AB’ + C’D
13. F(A,B,C) = ABC + ABC’ + A’C
14. F(X, Y, Z) = XY + X(Y+Z) + Y(Y+Z)
15. F(X, Y) = X’Y’ + X’Y + XY
16. F = W’X’YZ + W’XYZ + W’X’YZ’ + W’XYZ’
17. F = XY + X(Y+Z) + Y(Y+Z)
18. F(A, B, C) = A’B + ABC’ + ABC
19. F(A,B,C,D) = AB + A (CD + CD’)
20. Prove the following Boolean expression, using the truth table A
+ BC = (A+B) (A+C)

Discussion Questions:

1. Why is Boolean algebra important in digital circuits?

2. How do truth tables help in simplifying Boolean expressions?

3. How does De Morgan’s Theorem help in circuit simplification?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy