in Digital Logic edited by
3,759 views
5 votes
5 votes

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 ?

  1. {$NOT$, $OR$}
  2. {$NOR$}
  3. {$AND$, $OR$}
  4. {$AND$, $NOT$}
in Digital Logic edited by
3.8k views

3 Answers

11 votes
11 votes
Best answer
NAND AND NOR are universal gate  and with the help of these gates we can implement any other function. Hence they are called functionally complete

option a)

Not + Or = Nor gate only

option b ) It says NOR

option d ) And + not = NAND gate

So remaining is option c---which is answer :)
selected by

1 comment

But answer given in answer key is option B
0
0
5 votes
5 votes

A) NOT + OR = NOR (complete)

B) NOR(complete)

C) AND + OR = (not complete)

D) AND + NOT = NAND(complete)

by
2 votes
2 votes
c

NAND & NOR is functionally complete which can also be represented as option d & a respectively.
Answer:

Related questions