- #1

Live4eva_2

- 28

- 0

Hi...

I'm struggling in grasping how to reduce boolean expressions to K-maps/truth tables.

I drew a diagram in paint illustrating my steps in trying to reduce a function...

could someone please have a look and correct me in my method/point me in the right direction??

much appreciated...

Hope no-one minds but I posted this in the Comp_Sci section as well...because I know that this falls under both discrete maths and comp architecture...So rather check for my post there before wasting time providing help ,when someone else already has...

I'm struggling in grasping how to reduce boolean expressions to K-maps/truth tables.

I drew a diagram in paint illustrating my steps in trying to reduce a function...

could someone please have a look and correct me in my method/point me in the right direction??

much appreciated...

Hope no-one minds but I posted this in the Comp_Sci section as well...because I know that this falls under both discrete maths and comp architecture...So rather check for my post there before wasting time providing help ,when someone else already has...

#### Attachments

Last edited: