search
Log In

Recent questions tagged functional-completeness

0 votes
1 answer
1
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?
asked Dec 23, 2018 in Digital Logic gmrishikumar 113 views
0 votes
0 answers
2
0 votes
1 answer
3
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.
asked Sep 20, 2018 in Digital Logic jothee 132 views
1 vote
1 answer
4
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.
asked Aug 10, 2018 in Digital Logic MayankSharma 267 views
2 votes
3 answers
5
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 that its 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
asked Apr 18, 2018 in Digital Logic Na462 513 views
1 vote
1 answer
6
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$
asked Dec 17, 2017 in Digital Logic gatecse 1.4k views
2 votes
1 answer
7
Which of the following set is not functionally complete? a) {XOR,1,NOT} b) {XOR,1,OR} c) {OR, NOT} d) {XOR,1, AND}
asked Oct 4, 2017 in Digital Logic just_bhavana 1.5k views
3 votes
2 answers
8
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 and AND logic. For function f(X,Y ... ans is X as X is complement of X', hence this is functionally incomplete). How to prove OR / AND logic is possible for f(X,Y,Z)?
asked Apr 7, 2017 in Digital Logic AnilGoudar 1.9k views
6 votes
3 answers
9
Provide short answers to the following questions: Show that {NOR} is a functionally complete set of Boolean operations.
asked Nov 30, 2016 in Digital Logic makhdoom ghaya 582 views
2 votes
1 answer
10
4 votes
3 answers
11
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$}
asked Apr 26, 2016 in Digital Logic makhdoom ghaya 3k views
17 votes
2 answers
13
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
asked Oct 27, 2014 in Digital Logic Arjun 2.8k views
18 votes
2 answers
14
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.
asked Sep 26, 2014 in Digital Logic Kathleen 1.5k views
26 votes
4 answers
15
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$.
asked Sep 23, 2014 in Digital Logic Kathleen 7.3k views
To see more, click for the full list of questions or popular tags.
...