Comp Sci: Boolean Algebra Problem

Test Preparation AP Test Preparation
1

<p>Can anyone guide me as to how these problems would be solved?</p>

<p>Simplify the following Boolean expression as much as possible ((A + B)B’)’ + AB’</p>

<p>Choose all of the following that are equivalent to A(B’ + C)’ + (B’ (A + C’))’

  1. B(A + C’)
  2. A’ + (BC)
  3. B + A’C
  4. ABC’
  5. B’ + AC’ </p>

<p>Might be more than one answer.</p>

<p>Which of the choices below are simplifications of the following: ((AB) +(AB)‘)’

  1. 0
  2. 1
  3. AB
  4. (AB)’
  5. A + B’ </p>

<p>Might be more than one answer.</p>

<p>They are supposed to be solved using boolean identities.</p>

2

<p>This problem too:
Rewrite the following line of code using one of DeMorgan’s Laws: </p>

<p>while (!(x < y && count <= 0))</p>

3

<p>DeMorgan’s is !(A&B) = !A V !B</p>

<p>(V meaning “or” in this case, since I forget the Java symbol for it.)</p>

<p>So your problem would become while(!(x<y) V !(count<=0))</p>

4

<p>Yea I got that, but my teacher wants it even more reduced using the identity !(a <= b) => !a > !b. I can apply this to the first part but I can’t negate the zero in the second part.</p>