Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged functional-completeness
0
votes
0
answers
1
#boolean algebra #ex-or #functionally complete
jayadev
481
views
jayadev
asked
Dec 15, 2021
Digital Logic
digital-logic
functional-completeness
+
–
0
votes
1
answer
2
Partially Functional Complete
In GATE, I have seen a lot of questions where we are asked to check whether a set of operations is functionally complete or not. I know Functionally Complete and Partially Functionally Complete are two different things, but while marking answers in GATE, will we say a set is functionally complete even when it is partially functionally complete?
In GATE, I have seen a lot of questions where we are asked to check whether a set of operations is functionally complete or not.I know Functionally Complete and Partially...
gmrishikumar
818
views
gmrishikumar
asked
Dec 23, 2018
Digital Logic
functional-completeness
digital-logic
+
–
0
votes
0
answers
3
Functional Completeness Doubt
Is Ex-NOR functionally complete? pls explain in details
Is Ex-NOR functionally complete? pls explain in details
aditi19
330
views
aditi19
asked
Nov 16, 2018
Digital Logic
functional-completeness
digital-logic
+
–
1
votes
1
answer
4
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.
go_editor
426
views
go_editor
asked
Sep 20, 2018
Digital Logic
isi2017-pcb-cs
digital-logic
functional-completeness
descriptive
+
–
1
votes
1
answer
5
Functionally complete
F(x, y, z) =x + y'z' It's functionally complete according to normal procedure to implement NOT & OR or AND from it. But from this short trick. https://www.google.co.in/amp/s/www.geeksforgeeks.org/gate-gate-cs-2015-set-1-question-49/amp It's preserving 1.so it can't be functionally complete. I must be wrong but I could not identify it.
F(x, y, z) =x + y'z' It's functionally complete according to normal procedure to implement NOT & OR or AND from it. But from this short trick.https://www.google.co.in/amp...
MayankSharma
869
views
MayankSharma
asked
Aug 10, 2018
Digital Logic
functional-completeness
digital-logic
+
–
2
votes
3
answers
6
Functionally Complete
Suppose a function F(A,B) = A' + B then to prove it functionally complete.Can we do it like:- F(A,A') = A' ----> Complementation derived F(A',B) = A + B -----> OR Operation Derived So we could conclude ... functionally Complete. Is it the right way if not Please tell the right eay to prove the Function to be Functionally Complete. Thank You in advance
Suppose a function F(A,B) = A' + B then to prove it functionally complete.Can we do it like:- F(A,A') = A' Complementation derivedF(A',B) = A + B - OR Operati...
Na462
1.7k
views
Na462
asked
Apr 18, 2018
Digital Logic
functional-completeness
digital-logic
+
–
1
votes
1
answer
7
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...
gatecse
2.3k
views
gatecse
asked
Dec 17, 2017
Digital Logic
isrodec2017
functional-completeness
digital-logic
+
–
2
votes
1
answer
8
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}
just_bhavana
4.4k
views
just_bhavana
asked
Oct 4, 2017
Digital Logic
digital-logic
functional-completeness
+
–
4
votes
2
answers
9
Functionally Complete
Consider the operations defined as f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X′, Y, Z) = X′YZ + X′YZ′ + XY . Iam following this method, A function is said to be complete if it can implement Complementation and OR logic / Complementation ... X is complement of X', hence this is functionally incomplete). How to prove OR / AND logic is possible for f(X,Y,Z)?
Consider the operations defined as f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X′, Y, Z) = X′YZ + X′YZ′ + XY .Iam following this method, A function is said to be comp...
AnilGoudar
2.7k
views
AnilGoudar
asked
Apr 7, 2017
Digital Logic
functional-completeness
digital-logic
+
–
10
votes
3
answers
10
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.
makhdoom ghaya
1.6k
views
makhdoom ghaya
asked
Nov 29, 2016
Digital Logic
gate1989
descriptive
digital-logic
functional-completeness
+
–
2
votes
1
answer
11
Virtual Gate Test Series: Digital Logic - Functionally Complete
my doubt- I got first one not functionally complete but its partially complete because its use 0 for make a NOT gate please check
my doubt- I got first one not functionally complete but its partially complete because its use 0 for make a NOT gate please check
Hradesh patel
672
views
Hradesh patel
asked
Oct 8, 2016
Digital Logic
digital-logic
functional-completeness
virtual-gate-test-series
+
–
1
votes
3
answers
12
GATE Overflow | Digital Logic | Test 1 | Question: 25
All digital circuits can be realized using only Ex-OR gates AND, OR gates Half-adders OR gates
All digital circuits can be realized using onlyEx-OR gatesAND, OR gatesHalf-addersOR gates
Bikram
494
views
Bikram
asked
Sep 20, 2016
Digital Logic
digital-logic
go-digital-logic-1
digital-circuits
functional-completeness
combinational-circuit
+
–
1
votes
2
answers
13
GATE Overflow | Digital Logic | Test 1 | Question: 4
A set of Boolean connectives is known as 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 known as functionally complete if all Boolean functions can be Synthesized using those. Which of the following sets of connectives is not ...
Bikram
495
views
Bikram
asked
Sep 19, 2016
Digital Logic
digital-logic
go-digital-logic-1
functional-completeness
+
–
7
votes
3
answers
14
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$}{...
makhdoom ghaya
4.3k
views
makhdoom ghaya
asked
Apr 26, 2016
Digital Logic
isro2013
functional-completeness
digital-logic
digital-circuits
combinational-circuit
+
–
9
votes
6
answers
15
How to prove if a boolean function is functionally complete?
Samujjal Das 1
17.1k
views
Samujjal Das 1
asked
Apr 12, 2016
Digital Logic
functional-completeness
+
–
27
votes
2
answers
16
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...
Arjun
8.3k
views
Arjun
asked
Oct 27, 2014
Digital Logic
gateit-2008
digital-logic
easy
functional-completeness
+
–
17
votes
2
answers
17
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.
Kathleen
2.8k
views
Kathleen
asked
Sep 29, 2014
Digital Logic
gate1993
digital-logic
combinational-circuit
adder
descriptive
functional-completeness
+
–
23
votes
2
answers
18
GATE CSE 1998 | Question: 5
The implication gate, shown below has two inputs ($x \text{ and }y)$; the output is 1 except when $x =1 \text{ and } y=0\text{, realize }f=\bar{x}y+x\bar{y}$ using only four implication gates. Show that the implication gate is functionally complete.
The implication gate, shown below has two inputs ($x \text{ and }y)$; the output is 1 except when $x =1 \text{ and } y=0\text{, realize }f=\bar{x}y+x\bar{y}$ using only f...
Kathleen
3.7k
views
Kathleen
asked
Sep 25, 2014
Digital Logic
gate1998
digital-logic
functional-completeness
descriptive
+
–
37
votes
5
answers
19
GATE CSE 1999 | Question: 2.9
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$.
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?XOR gates, NOT gates$2$ to $1$ multiplexersAND gates, XOR gatesT...
Kathleen
15.0k
views
Kathleen
asked
Sep 23, 2014
Digital Logic
gate1999
digital-logic
normal
functional-completeness
multiple-selects
+
–
25
votes
4
answers
20
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
Kathleen
10.4k
views
Kathleen
asked
Sep 12, 2014
Digital Logic
gate1992
normal
digital-logic
digital-circuits
multiple-selects
functional-completeness
combinational-circuit
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register