0

I'm trying to make truth table for this and im terrible in boolean algebra. Can someone help me?

(A'+B')C+ABC'+A'C

  • 2
    'Help' is the right word, yes; we're not going to do this for you. So, what do you have so far, and where are you getting stuck? Here's a question you should be able to answer: how many rows do you need? – Bram28 Jan 23 '18 at 21:12
  • I don't know how to start. Can you just make this example step by step and tell me what you did all steps? – Mateusz Zablocki Jan 23 '18 at 21:16
  • OK, how about this: what columns will you have in the table? – Bram28 Jan 23 '18 at 21:17
  • ABC for sure others i don't know. – Mateusz Zablocki Jan 23 '18 at 21:20
  • (A'+B')C , ABC', A'C ? – Mateusz Zablocki Jan 23 '18 at 21:23
  • Yes, those are all good! OK, the three columns for just $A$, $B$, and $C$ are often called the 'reference columns'; they should reflect all the possible values that those three variables can take on. So, since each of those three can be either true (1) or false (0), how many possible combinations of values between those three variables can there be? (e.g. they can all be 1, or they can all be 0, or A and B can be 1 and C 0, or ..) – Bram28 Jan 23 '18 at 21:29
  • So i can make table with (A'+B')C | ABC' | A'C and just put 1, 0 in the right place and calculate? – Mateusz Zablocki Jan 23 '18 at 21:34
  • Sure, that's the idea ... but the question is: how many and where exactly do you place those 1's and 0's? To figure this out, the reference columns are key. So, with 3 variables A, B, and C, how many possible combinations of 0's and 1's do you have? – Bram28 Jan 23 '18 at 21:37
  • 8 combinations but if (A'+B')C giving result 2 (001) combination its just 1 yes? – Mateusz Zablocki Jan 23 '18 at 21:40
  • Don;t think too far ahead ... yes, it's 8 combinations, so that's the way you set up the table. I'll show that in an Answer below now. – Bram28 Jan 23 '18 at 21:41

1 Answers1

0

Set up:

There are $3$ variables involved, $A$, $B$, and $C$. With $3$ variables, you get $2^3=8$ combination. You can get all those combinations systematically like this: \begin{array}{ccc|c} A&B&C&statement(s) \ to \ be \ evaluated\\ \hline 0&0&0&\\ 0&0&1&\\ 0&1&0&\\ 0&1&1&\\ 1&0&0&\\ 1&0&1&\\ 1&1&0&\\ 1&1&1&\\ \end{array}

See how I did that? I had the $C$ alternate between $0$ and $1$ for every single row, the $B$ alternates every two rows, and the $A$ every four rows.

OK, rather than doing thew whole statement at once, break it down to its smaller terms. So, let's create a column for (A'+B')C, a column for ABC', and one for A'C:

\begin{array}{ccc|c|c|c} A&B&C&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&\\ 0&0&1&\\ 0&1&0&\\ 0&1&1&\\ 1&0&0&\\ 1&0&1&\\ 1&1&0&\\ 1&1&1&\\ \end{array}

OK, the $ABC'$ is easy:

\begin{array}{ccc|c|c|c} A&B&C&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&&0\\ 0&0&1&&0\\ 0&1&0&&0\\ 0&1&1&&0\\ 1&0&0&&0\\ 1&0&1&&0\\ 1&1&0&&1\\ 1&1&1&&0\\ \end{array}

OK, the $'C$ is pretty easy as well:

\begin{array}{ccc|c|c|c} A&B&C&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&&0&0\\ 0&0&1&&0&1\\ 0&1&0&&0&0\\ 0&1&1&&0&1\\ 1&0&0&&0&0\\ 1&0&1&&0&0\\ 1&1&0&&1&0\\ 1&1&1&&0&0\\ \end{array}

Now, if the $(A'+B')C$ is too hard to do in $1$ step, we can just break that one down as well, i.e. let's first figure out ust the $A'+B'$ term:

\begin{array}{ccc|c|c|c|c} A&B&C&A'+B'&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&&&0&0\\ 0&0&1&&&0&1\\ 0&1&0&&&0&0\\ 0&1&1&&&0&1\\ 1&0&0&&&0&0\\ 1&0&1&&&0&0\\ 1&1&0&&&1&0\\ 1&1&1&&&0&0\\ \end{array}

OK, $A'+B'$ is a $1$ as soon as either $A$ or $B$ is a $0$, so:

\begin{array}{ccc|c|c|c|c} A&B&C&A'+B'&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&1&&0&0\\ 0&0&1&1&&0&1\\ 0&1&0&1&&0&0\\ 0&1&1&1&&0&1\\ 1&0&0&1&&0&0\\ 1&0&1&1&&0&0\\ 1&1&0&0&&1&0\\ 1&1&1&0&&0&0\\ \end{array}

And now let's 'multiply' that by $C$:

\begin{array}{ccc|c|c|c|c} A&B&C&A'+B'&(A'+B')C&ABC'&A'C\\ \hline 0&0&0&1&0&0&0\\ 0&0&1&1&1&0&1\\ 0&1&0&1&0&0&0\\ 0&1&1&1&1&0&1\\ 1&0&0&1&0&0&0\\ 1&0&1&1&1&0&0\\ 1&1&0&0&0&1&0\\ 1&1&1&0&0&0&0\\ \end{array}

Finally, let's 'add' the three terms to get the truth-conditions of the statement as a whole:

\begin{array}{ccc|c|c|c|c|c} A&B&C&A'+B'&(A'+B')C&ABC'&A'C&(A'+B')C+ABC'+A'C\\ \hline 0&0&0&1&0&0&0&0\\ 0&0&1&1&1&0&1&1\\ 0&1&0&1&0&0&0&0\\ 0&1&1&1&1&0&1&1\\ 1&0&0&1&0&0&0&0\\ 1&0&1&1&1&0&0&1\\ 1&1&0&0&0&1&0&1\\ 1&1&1&0&0&0&0&0\\ \end{array}

Bram28
  • 100,612
  • 6
  • 70
  • 118
  • Ok and how i can evaluate my statement now? – Mateusz Zablocki Jan 23 '18 at 21:47
  • @MateuszZablocki Well, as you suggested yourself, rather than doing thew whole statement at once, break it down to its smaller terms. So, as you yourself already indicated, we can create a column for (A'+B')C, a column for ABC, and one for A'C. I'll add that to the table now ... done ... now, I think the last two shouldn't be too hard: in fact, what should be the values in ABC from top to bottom? – Bram28 Jan 23 '18 at 21:49
  • There is ABC' not ABC. All expect (110) should be 0, yes? – Mateusz Zablocki Jan 23 '18 at 21:55
  • @MateuszZablocki Whoops! Yes, it's ABC' rather than ABC, sorry about that! And yes, you right, all except 110 are 0. OK, I'll fill that in. How about A'C? – Bram28 Jan 23 '18 at 21:56
  • 001, 011 give us result 1 others 0. – Mateusz Zablocki Jan 23 '18 at 21:59
  • @MateuszZablocki Also correct! I'll fill those in too. Now, can you see the last one ... or is that one too hard to do in 1 step? If so, we can break it down further .... – Bram28 Jan 23 '18 at 22:00
  • 001,011,101,111 result is 1 others is 0. Am I right? – Mateusz Zablocki Jan 23 '18 at 22:04
  • @MateuszZablocki Well, let me check ... I decided to add an extra step by first figuring out $A'+B'$ ... divide and conquer! :) OK,... adding those values now ... – Bram28 Jan 23 '18 at 22:06
  • @MateuszZablocki Well, I filled out the values, and yes, you get a 1 for 001,011, and 101, but a 0 for 111, because with 111 the A'+B' term is 0. – Bram28 Jan 23 '18 at 22:09
  • Thank you for your help. Now i know better how to do it. :) – Mateusz Zablocki Jan 23 '18 at 22:10
  • @MateuszZablocki Ypou're welcome! Don;t forget to 'add' the three terms in the end. I'll do that too now and then I have to run ... Thanks for being responsive ... not everyone is like that :) – Bram28 Jan 23 '18 at 22:11