d2jsp
Log InRegister
d2jsp Forums > Off-Topic > Computers & IT > Programming & Development > K-maps > Bolean To Minterm
Add Reply New Topic New Poll
Member
Posts: 1,507
Joined: Mar 5 2007
Gold: 43.72
Nov 8 2012 10:58am
Can anyone do a example of the problems below? I want to know how to go from Boolean Algebra to making a minterm list, to creating a a K-Map.
If possible one example of a question that uses xOR, one of a Some of Products, one using a minterm list (#4). Any help would be appreciated!!!!

 = xOR
m(....) = minterm list
d(....) = don't care term (can be a 1 or a 0)

F1(x,y,z) = 1  x’y  z’

F2(x,y,z) = x  y  z’  xy’z

F3(w,x,y,z) = y’(w + xz) + y(wxz +w’x’z’)

F4(w,x,y,z) = m(1, 2, 6, 7, 8, 14) + d(9, 10, 12, 13)

F5(w,x,y,z) = (w’ + y)(x’ + y + z’)(w + x + y’)(w + y’ + z)
Member
Posts: 1,507
Joined: Mar 5 2007
Gold: 43.72
Nov 8 2012 11:36am
as well as a truth table would be nice
Member
Posts: 4,605
Joined: Sep 15 2011
Gold: 9,464.00
Nov 8 2012 12:07pm
plug and chug yo
Member
Posts: 1,507
Joined: Mar 5 2007
Gold: 43.72
Nov 8 2012 03:37pm
anyone?
Member
Posts: 32,925
Joined: Jul 23 2006
Gold: 3,804.50
Member
Posts: 1,507
Joined: Mar 5 2007
Gold: 43.72
Nov 8 2012 06:29pm
Quote (carteblanche @ Nov 8 2012 11:51pm)


I already did that, and watching videos on it now. i just want a way to check my values because my circuit doesn't seem to get the right values.
Go Back To Programming & Development Topic List
Add Reply New Topic New Poll