Register

ISRO-2013-22

• retagged by
4,468 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
User Avatar

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
User Avatar
5 votes
5 votes

A) NOT + OR = NOR (complete)

B) NOR(complete)

C) AND + OR = (not complete)

D) AND + NOT = NAND(complete)

User Avatar
2 votes
2 votes
c

NAND & NOR is functionally complete which can also be represented as option d & a respectively.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

571
views
3 answers
1 votes
Bikram asked Sep 20, 2016
571 views
GATE Overflow | Digital Logic | Test 1 | Question: 25
All digital circuits can be realized using onlyEx-OR gatesAND, OR gatesHalf-addersOR gates
User Avatar
11.0k
views
4 answers
26 votes
Kathleen asked Sep 12, 2014
10,970 views
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using onlyEx-OR gatesMultiplexersHalf addersOR gates
User Avatar
2.9k
views
2 answers
17 votes
Kathleen asked Sep 29, 2014
2,949 views
GATE CSE 1993 | Question: 9
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
User Avatar
3.0k
views
2 answers
5 votes
makhdoom ghaya asked May 13, 2016
2,970 views
ISRO-2013-77
The binary equivalent of the decimal number $42.75$ is$101010 . 110$$100110 . 101$$101010 . 101$$100110 . 110$
User Avatar
Link Copied!