0% found this document useful (0 votes)
2 views2 pages

HW 2

This document outlines the homework assignments for Digital Circuits, due on April 14, 2017, which includes tasks such as constructing truth tables, converting Boolean expressions to standard forms, and using Karnaugh maps for simplification. The homework consists of multiple problems that require the application of Boolean algebra concepts. Additionally, there is a section on 'don't care' conditions in truth tables.

Uploaded by

gxrc46r82m
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)
2 views2 pages

HW 2

This document outlines the homework assignments for Digital Circuits, due on April 14, 2017, which includes tasks such as constructing truth tables, converting Boolean expressions to standard forms, and using Karnaugh maps for simplification. The homework consists of multiple problems that require the application of Boolean algebra concepts. Additionally, there is a section on 'don't care' conditions in truth tables.

Uploaded by

gxrc46r82m
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

Digital Circuits: Homeworks #2

Due on Friday, April 14, 2017

Note: Late homework is not accepted. Good luck

1. Truth Table.
Construct a truth table of following Boolean expressions

(a) X = AB + B̄C + CA.


(b) X = (A + B)(B + C̄)(C + A).

2. Standard Forms of Boolean Expressions

(a) Convert X = (A + C)(CD + AC) to sum-of-product (SOP) form.


(b) Convert X = (A + C)(CD + AC) to product-of-sum (POS) form.
(c) Convert X = AB(CD + ĒF )(AB + CD) to sum-of-product (SOP) form.

3. Karnaugh Map
Let X = AB̄ + B C̄ + CD + AC D̄.

(a) Develop a truth table of X


(b) Use a Karnaugh map to reduce X to a minimum SOP form.
(c) Use a Karnaugh map to reduce X to a minimum POS form.

4. Karnaugh Map 2
Let X = (Ā + B)(Ā + B̄ + C̄)(B + C̄ + D)(A + B̄ + C + D̄).

(a) Develop a truth table of X


(b) Use a Karnaugh map to reduce X to a minimum SOP form.
(c) Use a Karnaugh map to reduce X to a minimum POS form.

5. Don’t Care!
For the following truth table, answer the following questions. Note that “x” means
don’t care.

Homework 2 Page 1 of 2
A B C D X
0 0 0 0 x
0 0 0 1 x
0 0 1 0 0
0 0 1 1 0
0 1 0 0 x
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 x
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(a) Draw a K-map (show all 0s, 1s, and x’s).


(b) Derive a minimum SOP expression using K-map.
(c) Derive a minimum POS expression using K-map.

Homework 2 Page 2 of 2

You might also like