
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 1
This page cannot be seen from the preview
Don't miss anything!

ECE130 Mark A. Yoder Homework #5 Page 1 of 1
(Boolean algebra) 1 (Problem 4 on page 28 of Dr. Eccles’ book). Use Boolean algebra to simplify
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 )= A • B • C + B • 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.
(d) Z^ ( A , B , C , D )= A • B • C + B • C • D + A • B • D 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