Question 33

Any set of Boolean operatorsthat is sufficient to represent all Boolean expressions is said to be complete. Which ofthe following is not complete?

Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free