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

Tutorial 2

This document provides a tutorial on Boolean algebra concepts including: - Constructing truth tables for Boolean expressions - Simplifying Boolean expressions using algebraic laws - Deriving Boolean expressions from circuit diagrams - Simplifying circuits using Boolean algebraic techniques Exercises include truth tables, simplification using laws and Karnaugh maps, and deriving and simplifying expressions for various logic circuits.

Uploaded by

qwer
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)
4 views4 pages

Tutorial 2

This document provides a tutorial on Boolean algebra concepts including: - Constructing truth tables for Boolean expressions - Simplifying Boolean expressions using algebraic laws - Deriving Boolean expressions from circuit diagrams - Simplifying circuits using Boolean algebraic techniques Exercises include truth tables, simplification using laws and Karnaugh maps, and deriving and simplifying expressions for various logic circuits.

Uploaded by

qwer
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

Diploma in Information Technology First City University College

TUTORIAL 1

1. Contsruct a truth table to show the value of the following Boolean expression.

i) A B
ii) A  (B  C)

iii) (C  D)  ( A  B)

iv) A B
v) A B  A B  B C
vi) ( A  B)  ( A  C )

2. Simplify the following Boolean expression.


i) A B  A B
ii) A  A B
iii) A  A B C
iv) A B C  A B C  A B C  A B C  A B C
v) ABC  AB  ABC
vi) ABC  ABC  ABC  ABC
vii) AB  AC  BC
viii) ( A  B)( A  C )( B  C )

ix) ( X  Y )( X  Y )( X  Z )

x) XYZ  XYZ  XY Z

3. Find the Boolean expression for the following circuits.

i) v)

Prepared by NSMN 1
Diploma in Information Technology First City University College

ii) vi)

iii) vii)

iv) viii)

4.

Base on the above circuit diagram,

i) find the Boolean expression of output F


ii) simplify the expression using laws of Boolean algebra
iii) construct the simplified diagram

Prepared by NSMN 2
Diploma in Information Technology First City University College

5.

Base on the above circuit diagram,


i) find the Boolean expression of output F2
ii) simplify the expression using laws of Boolean algebra
iii) construct the simplified diagram

6.

Base on the above circuit diagram,

i) find the Boolean expression of output F


ii) simplify the expression using laws of Boolean algebra
iii) construct the simplified diagram

Prepared by NSMN 3
Diploma in Information Technology First City University College

7.

Base on the above circuit diagram,


i) find the Boolean expression of output X.
ii) simplify the expression using laws of Boolean algebra.
iii) construct the simplified diagram.

8. If the Boolean expression E ( A, B, C )  ABC  AB AC ,  


i) Draw athe circuit diagram
ii) Simplify the expression using laws of Boolean algebra
iii) Construct the simplified diagram

9. Given that F ( A, B, C )  A  B  C  A  B  C  A  B  C  A  B  C .
i) Construct a truth table to show the output value of E.
ii) Simplify the Boolean expression using the Karnaugh Map Method.


10. Given that F  x, y, z    x  y  z  x  y  z .
i) Construct a truth table to show the output value of F.
ii) Simplify the Boolean expression using the Karnaugh Map Method.

Prepared by NSMN 4

You might also like