Scribd
Upload
179 views2 pages

Problem Set #2: Boolean Algebra and Logic Gates

This document contains a problem set for a logic design and digital circuits course. The problem set covers topics like simplifying Boolean expressions, drawing logic diagrams, determining if Boolean functions are true or false, finding complements of expressions, manipulating algebraic expressions involving Boolean variables, evaluating logical operations on bit strings, expressing functions in sum of minterms and product of maxterms form, writing Boolean expressions and constructing truth tables for circuits, drawing timing diagrams, and converting between sum of minterms and product of maxterms form. The problem set contains 13 problems covering these different logic design topics.

Uploaded by

AhmedGamal
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
179 views2 pages

Problem Set #2: Boolean Algebra and Logic Gates

This document contains a problem set for a logic design and digital circuits course. The problem set covers topics like simplifying Boolean expressions, drawing logic diagrams, determining if Boolean functions are true or false, finding complements of expressions, manipulating algebraic expressions involving Boolean variables, evaluating logical operations on bit strings, expressing functions in sum of minterms and product of maxterms form, writing Boolean expressions and constructing truth tables for circuits, drawing timing diagrams, and converting between sum of minterms and product of maxterms form. The problem set contains 13 problems covering these different logic design topics.

Uploaded by

AhmedGamal
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

Department of Electrical Engineering

ELE 215 – Logic Design and Digital Circuits


Spring 2019
Lem set

Problem set #2 Boolean Algebra and Logic Gates

1. Simplify the following Boolean expression to a minimum number of literals:


i. f1 = xy + xy'
ii. f2 = (x + y)(x + y')
iii. f3 = xyz' + x'yz + xyz + x'yz'
iv. f4 = (x + y + z')(x' + y' + z)
v. f5 = (a + b)'(a' + b')
vi. f6 = (x + y' + z')(x' + z')
vii. f7 = (a + b +c')(a'b' + c)
viii. f8 = (bc' + a'd)(ab' + cd')
ix. f9 = (a + b)' (a’ + b')'
2. Draw logic diagram of the circuits that implements the simplified expressions in
problem 1.
3. Determine wether the following Boolean functions is true or false:
(a) y'z' + yz' + x'z = x' + xz'
(b) xy + xz' + y'z = y'z' + xy + x'z'
4. Find the complement of the following expressions:
a) f = (a'b + cd)e' + e
b) g = (x' + y + z')(x + y')(x + z)
c) Show that f.f’=0 and f+f’ =1
5. Given that a.b=0 and a+b=1, use the algebraic manipulation to prove that:

6. Given the two eight-bit strings A=10110000 and B=00101101, evaluate the eight-bit
result after the following logical operations:
(a) AND (b) OR (c) XOR (d) NAND (e) NOR (f) NOT A.
7. Express the following function as a sum of mintems and as a product of maxterms:
(a) f = b'd + a'd + bd (b) bc’ + ab + cd
8. Write Boolean expressions and construct the truth tables describing the outputs of the
circuits described by Fig. 1.a.
9. By means of a timing diagram, show the signals of the outputs f, g and h in Fig1.b. as
functions of the two inputs a and b. Use all four possible combinations of a and b.

Problem Set #2 Page 1 of 2 ELE 215


10. For the functions defined by the following
truth table:
a) Find expressions for both T1 and T2.
b) Draw the logic diagram for T1 and T2,
using the obtained Boolean expressions.
c) Use Boolean algebra to simplify the
functions to a minimum number of literals.
d) Draw the logic diagram from the simplified
expressions, and compare the total number
of gates with the diagram of part (b).
11. By means of a timing diagram, show the signal of the output f in the following
figure as function of the two inputs x and y. use all four possible combinations of
the inputs.

12. Express the complement of the following functions in sum‐of‐minterms form:


a) f(a, b, c, d) = Σ(2, 4, 7, 10, 12, 14)
b) f( x, y, z ) = π(3, 5, 7)
13. Convert each of the following to the other canonical form:
a) f(x, y, z) = Σ(1, 3, 5)
b) f(a, b, c, d) = π(3, 5, 8, 11)

Problem Set #2 Page 2 of 2 ELE 215

You might also like