Register

Search results for functional-completeness

17 votes
2 answers
2
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.
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
User Avatar
10 votes
3 answers
6
GATE CSE 1989 | Question: 4-iii
Show that {NOR} is a functionally complete set of Boolean operations.
Show that {NOR} is a functionally complete set of Boolean operations.
User Avatar
1 votes
1 answer
8
ISI2017-PCB-CS-7-a
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
Show that $\{1,A \bar{B}\}$ is functionality complete, i.e., any Boolean function with variables $A$ and $B$ can be expressed using these two primitives.
User Avatar
27 votes
2 answers
11
GATE IT 2008 | Question: 1
A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives is NOT functionally complete? EX-NOR implication, negation OR, negation NAND
A set of Boolean connectives is functionally complete if all Boolean functions can be synthesized using those. Which of the following sets of connectives is NOT functiona...
User Avatar
0 votes
0 answers
12
Functional Completeness Doubt
Is Ex-NOR functionally complete? pls explain in details
Is Ex-NOR functionally complete? pls explain in details
User Avatar
2 votes
1 answer
14
Functionally complete sets
Which of the following set is not functionally complete? a) {XOR,1,NOT} b) {XOR,1,OR} c) {OR, NOT} d) {XOR,1, AND}
Which of the following set is not functionally complete?a) {XOR,1,NOT}b) {XOR,1,OR}c) {OR, NOT}d) {XOR,1, AND}
User Avatar
1 votes
1 answer
15
ISRO-DEC2017-76
Which of the following set of components is sufficient to implement any arbitrary Boolean function? $XOR$ gates, $NOT$ gates $AND$ gates, $XOR$ gates and $1$ $2$ to $1$ multiplexer Three input gates that output $(A.B)+C$ for the inputs $A, B, C$
Which of the following set of components is sufficient to implement any arbitrary Boolean function?$XOR$ gates, $NOT$ gates$AND$ gates, $XOR$ gates and $1$$2$ to $1$ mult...
User Avatar
7 votes
3 answers
18
ISRO-2013-22
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 ? {$NOT$, $OR$} {$NOR$} {$AND$, $OR$} {$AND$, $NOT$}
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 ?{$NOT$, $OR$}{$NOR$}{...
User Avatar
To see more, click for the full list of questions or popular tags.