Scribd
Upload
17 views2 pages

ECE 124 Digital Circuits and Systems Assignment #1

This document outlines an assignment for an ECE 124 digital circuits and systems course. The assignment contains 10 questions involving algebraic manipulation of Boolean expressions, determining truth tables, drawing logic diagrams, finding minimum sum-of-products and product-of-sums expressions, and converting between Boolean expression forms. Questions cover topics such as Boolean algebra, logic minimization, and implementation of logic functions using circuits.

Uploaded by

Yea
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
17 views2 pages

ECE 124 Digital Circuits and Systems Assignment #1

This document outlines an assignment for an ECE 124 digital circuits and systems course. The assignment contains 10 questions involving algebraic manipulation of Boolean expressions, determining truth tables, drawing logic diagrams, finding minimum sum-of-products and product-of-sums expressions, and converting between Boolean expression forms. Questions cover topics such as Boolean algebra, logic minimization, and implementation of logic functions using circuits.

Uploaded by

Yea
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

ECE 124 digital circuits and systems

Assignment #1

Q1: Use algebraic manipulation to show that:


(a) (x + y)(x + y 0 ) = x
(b) xy + yz + x0 z = xy + x0 z
Q2: Use algebraic manipulation to simply the following Boolean expressions
as much as possible:
(a) (x0 y 0 + z)0 + z + xy + wz (Hint: This expression simplifies to 3
literals).
(b) A0 B(D0 + C 0 D) + B(A + A0 CD) (Hint: This expression simplifies
to 1 literal).
Q3: Determine the truth tables for each of the following functions:
(a) (xy + z)(y + xz)
(b) (A0 + B)(B 0 + C)
(c) y 0 z + wxy 0 + wxz 0 + w0 x0 z
Q4: Draw logic diagrams for each of the following Boolean expressions:
(a) Y = A0 B 0 + B(A + C)
(b) Y = A0 + CD
(c) Y = (A + B 0 )(C 0 + D)(A0 + B + D)
Q5: Use algebraic manipulation to find the minimum product-of-sums (POS)
expressions for the following functions:
0

(a) f = (x1 + x3 + x4 )(x1 + x2 + x3 )(x1 + x2 + x3 + x4 )


0

(b) f = x2 + x1 x3 + x1 x3
Q6: Use algebraic manipulation to find the minimum sum-of-products (SOP)
expressions for the following functions:
0

(a) f = x1 x2 x3 + x1 x2 x4 + x1 x2 x3 x4
1

ECE 124 digital circuits and systems


0

Page 2
0

(b) f = x1 x2 x3 + x1 x3 + x2 x3 + x1 x2 x3
Q7: Determine the simplest sum-of-products circuit that implements the
P
function f (x1 , x2 , x3 ) = m(1, 3, 4, 6, 7).
Q8: Determine the simplest product-of-sums circuit that implements the
function f (x1 , x2 , x3 ) = M (0, 2, 5).
Q9: Convert each of the following Boolean expressions into both sum-ofproducts and product-of-sums:
(a) (AB + C)(B + C 0 D)
(b) x0 + x(x + y 0 )(y + z 0 )
0

Q10: Express f (x1 , x2 , x3 , x4 ) = x2 x4 + x1 x4 + x2 x4 as both a sum-ofminterms and as a product-of-maxtems.

You might also like