ISRO Computer Science (CSE) 2013 - Question 22

All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2013

Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete?

  • A. {NOT, OR}
  • B. {NOR}
  • C. {AND, OR}
  • D. {AND, NOT}

Answer: C. {AND, OR}

Explanation: {AND, OR} cannot generate NOT, so it is not functionally complete.

| | All questions of ISRO Computer Science (CSE) 2013