Boolean Algebra (POS Expression)

Discussion in 'Homework Help' started by Shamieh, Jan 27, 2014.

  1. Shamieh

    Thread Starter Member

    Oct 24, 2013
    36
    1
    Use algebraic manipulation to find the minimum product of-sums expression for the function:(A + C + D) (A + B! + C)(A + B! + C! + D)

    What am I doing wrong??

    Here is what I have so far...

    1) I need each expression to have all of the terms.
    2) so I said okay the first term is missing a B, and the second term is missing a D so I did...

    (A + B + C + D)(A + B! + C + D!)(A + B! + C + D)(A + B! + C + D!)(A + B! + C! + D)
    =(A + C) (A + B! + C)(A + B! + D)(A + B! + C + D!)
    =(A + C)(A + B! + C)(A + B! + C)
    =(A + C)(A + B! + C)

    is this correct?
    please help! Been stuck on this problem for HOURS
     
  2. WBahn

    Moderator

    Mar 31, 2012
    17,737
    4,789
    Well, ask yourself if they agree for simple cases.

    Q1) If A is HI, then the original expression is HI regardless of the state of any of the other inputs. Is this true of your result?

    Q2) If A is LO but C is HI, then your result is HI regardless of the state of any of the other variables. Is this true of the original expression?
     
  3. WBahn

    Moderator

    Mar 31, 2012
    17,737
    4,789
  4. Shamieh

    Thread Starter Member

    Oct 24, 2013
    36
    1
    Awesome, thanks so much for the link! Finally someone who explains this information in HUMAN ENGLISH and not gibberish I can't read!
     
  5. WBahn

    Moderator

    Mar 31, 2012
    17,737
    4,789
    Thank you very much. I'm glad you found it helpful.
     
Loading...