Recent content by Charles Henderson
-
Boolean Algebra - Simplifying to two different expressions
I KNEW it had something to do with those 2 terms. I just couldn't figure out how to prove it. I just put together the whole truth table and it checks. There is only one place in the table where AC or A Not B change the result and it is on the same row. I was convinced that there was a mistake or...- Charles Henderson
- Post #12
- Forum: Programming and Computer Science
-
Boolean Algebra - Simplifying to two different expressions
Answer 1 is the correct answer to the problem as correctly stated. There is no "fail". There is a truth table based on the values of B and C which can each take on values 1 or 0 for 4 possible combinations (00, 01, 10, 11). NOT B simply changes an input of 0 to 1 or an input of 1 to 0 (it's a...- Charles Henderson
- Post #9
- Forum: Programming and Computer Science
-
Boolean Algebra - Simplifying to two different expressions
PeroK, Thanks for the input but I do not understand the Test/Pass/Fail terminology. In case there are different ways of looking at these types of problems this is a digital electronics circuit where A, B and C are input signals (logical 1 or 0, yes/no, true/false) and the AND and ORs are logic...- Charles Henderson
- Post #7
- Forum: Programming and Computer Science
-
Boolean Algebra - Simplifying to two different expressions
Can you elaborate a little more? I'm not seeing your point.- Charles Henderson
- Post #4
- Forum: Programming and Computer Science
-
Boolean Algebra - Simplifying to two different expressions
For the expression: (B and C) or (not B and not C) or (A and (not B) and not C) I get two different answers depending on the order I do the simplification. 1. If I factor C out of the first and third terms I get (B and C) or (A and C) or (not B and not C) 2. If I factor not B out of the...- Charles Henderson
- Thread
- Algebra Boolean algebra Expressions
- Replies: 12
- Forum: Programming and Computer Science