Draw the Karnaugh map for this Boolean function.
A Boolean function f(x,y,z,w) has the rows with output value 1 defined by the set:
S(f) = { (0,0,0,1), (0,1,0,1), (1,0,0,0), (1,0,0,1), (1,1,0,0), (1,1,0,1), (1,1,1,0), (1,1,1,1) }
a. Draw the Karnaugh map for this Boolean function.
b. can you help me write a Boolean polynomial for this function that will require the fewest AND, OR, and NOT gates. (Only 2-input AND and OR gates are allowed.)
Answers
Status NEW
Posted 31 Oct 2017 01:10 PM
My Price 5.00
----------- Â ----------- H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly
Not Rated(0)