Project #38824 - Boolean Exp

    Construct a truth table for:

M  =  A’B C’ +  A’B C  +  A B’C  +  A B C

 

A

B

C

M

0

0

0

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

1

1

1

 

 

           

 

2.         Draw a  NOT, AND, OR circuit in sum of products (SOP) form that represents the equation above.

3.         The truth table for a Boolean expression is shown below.  Write the Boolean expression 

 

x

y

z

F

0

0

0

1

0

0

1

0

0

1

0

0

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

0

1

1

1

1

4.         Find the truth table that describes the following circuit:

 (attached)

 

 

Subject Computer
Due By (Pacific Time) 08/31/2014 11:59 am
Report DMCA
TutorRating
pallavi

Chat Now!

out of 1971 reviews
More..
amosmm

Chat Now!

out of 766 reviews
More..
PhyzKyd

Chat Now!

out of 1164 reviews
More..
rajdeep77

Chat Now!

out of 721 reviews
More..
sctys

Chat Now!

out of 1600 reviews
More..
sharadgreen

Chat Now!

out of 770 reviews
More..
topnotcher

Chat Now!

out of 766 reviews
More..
XXXIAO

Chat Now!

out of 680 reviews
More..
All Rights Reserved. Copyright by AceMyHW.com - Copyright Policy