ECE130 Homework #5: Boolean Algebra Problems, Assignments of Electrical and Electronics Engineering

Solutions to various boolean algebra problems from ece130 homework #5, including simplifying boolean expressions using karnaugh maps and demorgan's theorems, converting logic expressions to minterm and maxterm canonical forms, and finding the sum-of-products and product-of-sums forms of given expressions. Students of electrical engineering or computer science may find this document useful for studying and preparing exams or assignments related to boolean algebra.

Typology: Assignments

Pre 2010

Uploaded on 08/13/2009

koofers-user-rbw
koofers-user-rbw 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE130 Mark A. Yoder Homework #5 Page 1 of 1
Name _____________________ CM _____ Due date: Thursday, Sept. 18
ECE130-03 Homework #5 Fall 2003
(Boolean algebra)
1 (Problem 4 on page 28 of Dr. Eccles’ book). Use Boolean algebra to simplify
CBABABACBAZ ++=),,( . Be sure to indicate which theorems you are
applying.
2 (Adapted from Problem 10 on page 29 of Dr. Eccles’ book). Complement each of
the following, using DeMorgan’s theorem so that a sum-of-product expression will
become a product-of-sum one, and visa versa.
(a) CBCBACBAZ +=),,(
(b) )()(),,( CACBACBAZ +++=
3 (Adapted from Problem 11 on page 29 of Dr. Eccles’ book). Convert the following
functions to their minterm canonical form using (a) logic expression and (b) the Σ
notation.
(c) ) CBABACBAZ +=),,(
(d) DBADCBCBADCBAZ ++=),,,(
4 (Adapted from Problem 19 on page
29 of Dr. Eccles’ book). Write the
maxterm canonical form using the Π
notation for the following truth table.
5 (Adapted from Problem 21 on page
29 of Dr. Eccles’ book). For the truth
table in Problem 4, write the
minterm canonical form using the Σ
notation.
A B C Z(A,B,C)
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

Partial preview of the text

Download ECE130 Homework #5: Boolean Algebra Problems and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

ECE130 Mark A. Yoder Homework #5 Page 1 of 1

Name _____________________ CM _____ Due date: Thursday, Sept. 18

ECE130-03 Homework #5 Fall 2003

(Boolean algebra) 1 (Problem 4 on page 28 of Dr. Eccles’ book). Use Boolean algebra to simplify

Z ( A , B , C )= A • B + A • B + A • B • C. Be sure to indicate which theorems you are

applying. 2 (Adapted from Problem 10 on page 29 of Dr. Eccles’ book). Complement each of the following, using DeMorgan’s theorem so that a sum-of-product expression will become a product-of-sum one, and visa versa. (a) Z^ ( A , B , C )= ABC + BC

(b) Z^ (^ A , B , C )=( A + B + C )•( A + C )

3 (Adapted from Problem 11 on page 29 of Dr. Eccles’ book). Convert the following functions to their minterm canonical form using (a) logic expression and (b) the Σ notation.

(c) ) Z^ ( A , B , C )= A • B + A • B • C

(d) Z^ ( A , B , C , D )= ABC + BCD + ABD 4 (Adapted from Problem 19 on page 29 of Dr. Eccles’ book). Write the maxterm canonical form using the Π notation for the following truth table. 5 (Adapted from Problem 21 on page 29 of Dr. Eccles’ book). For the truth table in Problem 4, write the minterm canonical form using the Σ notation. A B C Z(A,B,C) 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 0