Scribd
Upload
42 views1 page

DIGIELECS1 Quiz2

This document contains a quiz for a digital electronics course. It has four sections: 1. Simplifying Boolean algebra expressions. 2. Converting Boolean algebra expressions to sum-of-products form. 3. Deriving simplified sum-of-products and product-of-sums expressions from truth tables. 4. Designing a logic circuit with a HIGH output only if a 4-bit binary input is greater than 11 or less than 4, including developing a truth table and drawing the logic diagram.

Uploaded by

Jonathan David
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
42 views1 page

DIGIELECS1 Quiz2

This document contains a quiz for a digital electronics course. It has four sections: 1. Simplifying Boolean algebra expressions. 2. Converting Boolean algebra expressions to sum-of-products form. 3. Deriving simplified sum-of-products and product-of-sums expressions from truth tables. 4. Designing a logic circuit with a HIGH output only if a 4-bit binary input is greater than 11 or less than 4, including developing a truth table and drawing the logic diagram.

Uploaded by

Jonathan David
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/ 1

Digital Electronics 1

Name ____________________________________ Quiz No. 2


Year and Section __________________________ Date __________________
I. Simplify the following expressions using Boolean Algebra: (25 pts.)
a. CE + C(E + F) + E’(E + G)
b. B’C’D + (B + C + D)’ + B’C’D’E
c. (C + CD)(C + C’D)(C + E)
d. BCDE + BC(DE)’ + (BC)’DE
e. BCD[BC + D’(CD +BD)]

II. Using Boolean Algebra, convert the following expressions to simplified sum-of-product (SOP)
forms: (25 pts.)
a. A(AD’ + C)
b. (A + C)(CD + AC)
c. BC + DE(BC’ + DE)
d. BC(C’D’ + CE)
e. B + C[BD + (C + D’)E]

III. For each truth table shown, derive a simplified standard SOP and a simplified standard POS
expressions using Boolean Algebra: (25 pts.)
(a) (b)
A B C F A B C D F
0 0 0 0 0 0 0 0 1
0 0 1 1 0 0 0 1 1
0 1 0 0 0 0 1 0 0
0 1 1 0 0 0 1 1 1
1 0 0 1 0 1 0 0 0
1 0 1 1 0 1 0 1 1
1 1 0 0 0 1 1 0 1
1 1 1 1 0 1 1 1 0
1 0 0 0 0
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

IV. Design Problems:


a. Design a logic circuit to produce a HIGH output only if input, represented by a 4-bit
binary number, is greater than eleven or less than four. First develop the truth table and
then draw the logic diagram. (25 pts.)

You might also like