

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
Problem set 2 for the ece 2030 course at georgia tech, which was due on september 19, 2005. The assignment includes exercises on deriving sum-of-minterms and product-of-maxterms expressions using boolean algebra, as well as finding simplified sum-of-products (sop) and product-of-sums (pos) expressions using k-maps.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


SCHOOL of ELECTRICAL and COMPUTER ENGINEERING ECE 2030 Fall 2005 Problem Set #
Assigned: 12-Sep- Due Date: 19-Sep-
This assignment is due at the beginning of class on Monday, September 19.
Problem 1 (2 pts):
Use Boolean algebra only to derive the sum-of-minterm expression for the following binary func- tions. Please sort the terms in your answer so that they are in increasing minterm index order. (Do not use truth tables.)
(a) F = ( a + b ) c b
(b) F = c + ( c + a )b
(c) F = (a โ b) โ c
(d) F = a (bc + b c d + c d)
Problem 2 (2 pts):
Use Boolean algebra only to derive the product-of-maxterm expression for the following binary functions. Please sort the terms in your answer so that they are in increasing maxterm index order. (Do not use truth tables.)
(a) F = ( a + b ) c b
(b) F = c + ( c + a )b
(c) F = (a โ b) โ c
(d) F = a (bc + b c d + c d)
Problem 3 (2 pts):
Use a K-map to find the most simplified SOP expression for each of the following binary functions.
(a) F = ( a + b + c) c b
(b) F =
โ m(1, 2 , 7 , 8 , 11 , 12 , 14 , 15)
(c) F =
โ M (0, 1 , 6 , 9 , 10 , 11 , 14 , 15)
Problem 4 (2 pts):
Use a K-map to find the most simplified POS expression for each of the following binary functions.
(a) F = ( a + b + c) c b
(b) F =
โ m(1, 2 , 7 , 8 , 11 , 12 , 14 , 15)
(c) F =
โ M (0, 1 , 6 , 9 , 10 , 11 , 14 , 15)
Problem 5 (2 pts):
Find the most simplified POS and SOP expressions for the K-maps below.
F 1 (a, b, c, d) :
1 x
0 x
1 x
x x
a
c
b
d
F 2 (a, b, c, d) :
x x
x x a
c
b
d