Scribd
Upload
9 views14 pages

Boolean Algebra Identities and Simplifications

The document contains a series of problems related to Boolean algebra, including validation of identities using truth tables, simplification of Boolean expressions, and drawing logic diagrams. It also involves finding complements of expressions, performing logical operations on bit strings, and obtaining truth tables for various functions. Additionally, it covers topics such as dual expressions and converting expressions into different forms.

Uploaded by

aarthur0224
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
9 views14 pages

Boolean Algebra Identities and Simplifications

The document contains a series of problems related to Boolean algebra, including validation of identities using truth tables, simplification of Boolean expressions, and drawing logic diagrams. It also involves finding complements of expressions, performing logical operations on bit strings, and obtaining truth tables for various functions. Additionally, it covers topics such as dual expressions and converting expressions into different forms.

Uploaded by

aarthur0224
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

Problem 2.

1
Validate the following identities by means of
truth tables.
(a) DeMorgan’s theorem:
(x + y + z)’ = x’y’z’ and (xyz)’ = x’ + y’ + z’
(b) The distributive law:
x + yz = (x + y)(x + z)
Problem 2.11
List the truth table of the function:
(a) F = x’z’ + xy + yz
(b) F = a’b’c’ + a’bc + ab’c’ + abc
Problem 2.2
Simplify the following Boolean expressions to a
minimum number of literals:
(a) xy + xy’
(b) (x + y)(x + y’)
(c) xyz + x’y + xyz’
(d) (x + y)’(x’ + y’)’

(f) a’bc + abc’ + abc + a’bc’


Problem 2.4
Reduce the following Boolean expressions to the
indicated number of literals:
(a) x’y’z’ + y + xy’z’ to two literals
(b) x’y(x’ + z’) + x’y + xyz to three literals
(c) (x + yz)’ + (x + y’z’)’ to one literal
(d) (w’ + x)(w + y)(x’ + y)(w + xyz) to four literals
(e) wxy’z’ + wy’ + wx’y’z’ to two literals
Problem 2.7
Draw logic diagrams of circuits that implement
the original and simplified expression for
(a) x’y’z’ + y + xy’z’ to two literals
Problem 2.13
Use only AND, OR, and NOT gates to draw logic
diagrams to implement the following Boolean
expressions:
(a) F = (u + x’)(y’ + z)

(e) F = u + yz + uxy
Problem 2.8
Find the complement of F = x’y + yz’; then show
that FF’ = 0 and F + F’ = 1.
Problem 2.9
Find the complement of the following
expressions:
(a) xyz + x’y’z’
(b) (x + y’)(y + z’)(z + x’)
(c) w’x’ + w(x + y + z)
Problem 2.12
We can perform logical operations on strings of
bits by considering each pair of corresponding
bits separately (called bitwise operation).
Given two eight-bit strings A = 11001010 and
B = 10010011, evaluate the eight-bit result
after the following logical operations:
(a) AND
(b) OR
(d) NOT A
Problem 2.24
Find the dual of the expression:
x’y + (x + z)(x + y’)
Problem 2.15
Simplify the following Boolean functions T1 and
T2 to a minimum number of literals:
A B C T1 T2
0 0 0 0 1
0 0 1 1 0
0 1 0 1 1
0 1 1 1 0
1 0 0 0 0
1 0 1 1 1
1 1 0 0 0
1 1 1 1 1
Problem 2.17
Obtain the truth table of the following functions,
and express each function in sum-of-minterms
and product-of-maxterms form:
(a) (ac + b)(ab + d)
(b) (a’ + c’ + d’)(ab + cd)
(c) (b + c’d’)(a + bc’)
(d) a’b’c’ +acd + ab’d’ + b’cd
Problem 2.22
Convert the expression (w + xy’)(x + y’z) into
sum of products and product of sums.
Problem 2.28
Write Boolean expression and construct the
truth table describing the output of the
following circuit.

You might also like