I'm stuck on understanding the concept behind truth tables..Here is an example of a truth table I am trying to build...

M = A'B’C’ + A’B C + A B’C’ + A B’C + A B C​

I have the initial part done, however I'm stuck filling in the "M" portion of the table. I have the table built, but huge formating issues when I try to post it. I'll attach the table as a jpg

 

Ok, I've got the table built...NOW, I have to create a Karnaugh Map, and NOT,AND,OR circut out of my findings..Attached is the "completed table."

 

I think your truth table is wrong. You are missing A'BC.

 

hi every body,
please can any one answer this question
What is the main drawback of using truth table to prove the equality of Boolean functions?

 

hi every body,
please can any one answer this question
What is the main drawback of using truth table to prove the equality of Boolean functions?

When you have many inputs, the table becomes huge. For three inputs you have 2^3=8 rows. Now consider four inputs, 2^4=16 rows. Now consider five inputs, 2^5=32 rows, and so on. Do you really want to fill a 32 row truth table by hand? Even on computer it is annoying.

 

thnx a lot i already know that but i thought the answer of the question would be more complex
any way, thank u