Register

GATE CSE 1999 | Question: 2.9

• edited by
15,150 views
37 votes
37 votes

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?

  1. XOR gates, NOT gates

  2. $2$ to $1$ multiplexers

  3. AND gates, XOR gates

  4. Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.

• edited by
User Avatar

5 Answers

–2 votes
–2 votes
answer - C
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

22 votes
22 votes
2 answers
1
Kathleen asked Sep 23, 2014
7,347 views
GATE CSE 1999 | Question: 2.17
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
User Avatar
25 votes
25 votes
4 answers
2
Kathleen asked Sep 12, 2014
10,503 views
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
All digital circuits can be realized using onlyEx-OR gatesMultiplexersHalf addersOR gates
User Avatar
54 votes
54 votes
3 answers
3
Kathleen asked Sep 23, 2014
15,523 views
GATE CSE 1999 | Question: 2.23
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor? Pointers Arrays Records Recursive procedures with local variable
A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this proces...
User Avatar
Link Copied!