retagged by
4,342 views
7 votes
7 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$}
retagged by

3 Answers

Best answer
11 votes
11 votes
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
5 votes
5 votes

A) NOT + OR = NOR (complete)

B) NOR(complete)

C) AND + OR = (not complete)

D) AND + NOT = NAND(complete)

2 votes
2 votes
c

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

Related questions

1 votes
1 votes
3 answers
1
25 votes
25 votes
4 answers
2
17 votes
17 votes
2 answers
3
Kathleen asked Sep 29, 2014
2,755 views
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
5 votes
5 votes
2 answers
4
makhdoom ghaya asked May 13, 2016
2,904 views
The binary equivalent of the decimal number $42.75$ is$101010 . 110$$100110 . 101$$101010 . 101$$100110 . 110$