Recent content by ibcoding

  1. I

    Find Min AND-OR Expression in K-Map w/Don't Cares

    Nevermind...it's right. Sorry to post prematurely
  2. I

    Find Min AND-OR Expression in K-Map w/Don't Cares

    For a little more clarity: E(0,3,14) + d(2,4,7,8,10,11,13,15)
  3. I

    Find Min AND-OR Expression in K-Map w/Don't Cares

    I am trying to find the minimum AND-OR expression in a K-map with Don't Cares. My Karnaugh map is attached below. Here is the min AND-OR expression, I believe.b'd' + b'c + ac
  4. I

    Is This Boolean Expression Simplified Correctly?

    The equation breaks down to a'b + b'c' + a'bp, I believe.
  5. I

    Is This Boolean Expression Simplified Correctly?

    Sorry, I wasn't complaining. :) Alright, that's the same as what I have.
  6. I

    Is This Boolean Expression Simplified Correctly?

    which gives me three and gates and two or gates
  7. I

    Is This Boolean Expression Simplified Correctly?

    So the equation should be a'(b + c') + b'pc'
  8. I

    Is This Boolean Expression Simplified Correctly?

    Ahh, the a' a' are adjacent so it is absorbed, got ya
  9. I

    Is This Boolean Expression Simplified Correctly?

    Alright, variable p is missing from that equation, but I get the idea. On that note, is this the correct truth table outputs: 1 1 0 0 1 1 1 1 1 1 0 0 0 0 0 0
  10. I

    Is This Boolean Expression Simplified Correctly?

    Ok, I know exactly which line you are talking about; I thought the same thing. I'll change that around. Thanks!
  11. I

    Is This Boolean Expression Simplified Correctly?

    The boolean expression I am working with is: ((ab)'(b'c)' + a'bpc') where ' is the NOT symbol. I have the following logic circuit diagram. Is it correct?