digital logic

  1. BeginnerLevel1

    Solving boolean expression using annihilation rule

    Suppose I have a function described as: AB+(1+AB+CK+G) Can I asssume that the expression I have inside the brackets is equal to 1? annihilation rule:0x=0,1+x=1 I need to reduce the function in order to have a minimum of logic gates.
  2. I

    Deriving Product of Sum from circuit (decoder + AND gate)

    This is a question that I'm supposed to complete. But I'm not sure if I'm on the right track. Can someone tell me if this is the right approach? I've been struggling with this module, and would appreciate some tips on going in the right direction. Here's my answer, which I'm quite certain is...