Equivalent Boolean Expressions (De Morgan's Laws)

AP Computer Science A· difficulty 4/5

Negation of <code>x > 0 && y < 10</code> is

  • A

    x <= 0 || y >= 10

    check_circle
  • B

    x <= 0 && y >= 10

  • C

    x > 0 || y < 10

  • D

    x < 0 || y > 10

Explanation

De Morgan: !(A && B) = !A || !B.

Want 10 more like this — adaptive to your weak spots?

Related questions