0% found this document useful (0 votes)
38 views2 pages

Boolean Algebra Exercises

The document outlines various tasks related to Boolean algebra, including writing expressions, verifying laws using truth tables, and simplifying expressions. It also involves constructing truth tables and logic circuits based on given expressions. Additionally, it requires determining equivalence among logic circuits.

Uploaded by

nttungbeeng
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
0% found this document useful (0 votes)
38 views2 pages

Boolean Algebra Exercises

The document outlines various tasks related to Boolean algebra, including writing expressions, verifying laws using truth tables, and simplifying expressions. It also involves constructing truth tables and logic circuits based on given expressions. Additionally, it requires determining equivalence among logic circuits.

Uploaded by

nttungbeeng
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

Boolean Algebra

1. Using Boolean notation, write an expression that is a 0 only when all of its variables (A, B,
C, and D) are 0s.

2. Write an expression that is a 1 when one or more of its variables (A, B, C, D, and E) are 0s.

3. In the Boolean Algebra, verify using truth table that A + A.B = A


4. In the Boolean Algebra, verify using truth table that ̅̅̅̅̅̅̅̅ ̅ ̅
5. Prove these laws of Boolean algebra with the help of truth table.
a. A+A =A
b. A.A=A
c. A + ̅ = 1
d. A. ̅ =0

6. Find the value of X for all possible values of the variables :

(a) X = A + B + C
(b) X = (A + B)C

7. Write the Boolean expression for each of the logic gates in Figure 1 :

Figure 1
8. Write the Boolean expression for each of the logic circuits in Figure 2 :

Figure 2
9. Draw the logic circuit represented by each of the following expressions:
(a) A + B + C + D
(b) ABCD
(c) A + BC
(d) ABC + D
(e) AB + ̅̅̅̅

10. Construct a truth table for each of the following Boolean expressions :
(a) A+B+C
(b) ABC
(c) AB + BC + CA
(d) (A + B)(B + C)(C + A)
(e) ̅ ̅ ̅

11. Using Boolean algebra techniques, simplify the following expressions:


(a) A(A + B)
(b) A( ̅ + AB)
(c) BC + ̅C
(d) (̅ + B)(A + C)
(e) BC + ̅̅̅̅̅̅ + B
(f) A̅ + A̅C + A̅CD + A ̅CDE
(g) CE + C(E + F) + ̅(E + G )
(h) (C + CD)(C + ̅ D)(C + E )

12. Determine which of the logic circuits in Figure 3 are equivalent :

Figure 3

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