ECE 2030 Problem Set 2 - Boolean Algebra & K-map Exercises (Fall 2005, Georgia Tech), Assignments of Electrical and Electronics Engineering

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

Pre 2010

Uploaded on 08/04/2009

koofers-user-7ca-1
koofers-user-7ca-1 ๐Ÿ‡บ๐Ÿ‡ธ

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
GEORGIA INSTITUTE OF TECHNOLOGY
SCHOOL of ELECTRICAL and COMPUTER ENGINEERING
ECE 2030 Fall 2005
Problem Set #2
Assigned: 12-Sep-05
Due Date: 19-Sep-05
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=Pm(1,2,7,8,11,12,14,15)
(c) F=QM(0,1,6,9,10,11,14,15)
pf2

Partial preview of the text

Download ECE 2030 Problem Set 2 - Boolean Algebra & K-map Exercises (Fall 2005, Georgia Tech) and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

GEORGIA INSTITUTE OF TECHNOLOGY

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