Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged functional-completeness
0
votes
0
answers
1
#boolean algebra #ex-or #functionally complete
jayadev
asked
in
Digital Logic
Dec 16, 2021
by
jayadev
125
views
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?
gmrishikumar
asked
in
Digital Logic
Dec 23, 2018
by
gmrishikumar
489
views
functional-completeness
digital-logic
0
votes
0
answers
3
Functional Completeness Doubt
Is Ex-NOR functionally complete? pls explain in details
aditi19
asked
in
Digital Logic
Nov 16, 2018
by
aditi19
204
views
functional-completeness
digital-logic
0
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.
go_editor
asked
in
Digital Logic
Sep 20, 2018
by
go_editor
310
views
isi2017-pcb-cs
digital-logic
functional-completeness
descriptive
1
vote
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.
MayankSharma
asked
in
Digital Logic
Aug 10, 2018
by
MayankSharma
601
views
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 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
Na462
asked
in
Digital Logic
Apr 18, 2018
by
Na462
1.2k
views
functional-completeness
digital-logic
1
vote
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$
gatecse
asked
in
Digital Logic
Dec 17, 2017
by
gatecse
2.0k
views
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}
just_bhavana
asked
in
Digital Logic
Oct 4, 2017
by
just_bhavana
3.4k
views
digital-logic
functional-completeness
3
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 and AND logic. For ... 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)?
AnilGoudar
asked
in
Digital Logic
Apr 7, 2017
by
AnilGoudar
2.3k
views
functional-completeness
digital-logic
9
votes
3
answers
10
GATE CSE 1989 | Question: 4-iii
Show that {NOR} is a functionally complete set of Boolean operations.
makhdoom ghaya
asked
in
Digital Logic
Nov 30, 2016
by
makhdoom ghaya
1.1k
views
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
Hradesh patel
asked
in
Digital Logic
Oct 8, 2016
by
Hradesh patel
389
views
digital-logic
functional-completeness
virtual-gate-test-series
0
votes
2
answers
12
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
Bikram
asked
in
Digital Logic
Sep 19, 2016
by
Bikram
212
views
digital-logic
go-digital-logic-1
functional-completeness
5
votes
3
answers
13
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$}
makhdoom ghaya
asked
in
Digital Logic
Apr 26, 2016
by
makhdoom ghaya
3.7k
views
isro2013
functional-completeness
9
votes
6
answers
14
How to prove if a boolean function is functionally complete?
Samujjal Das 1
asked
in
Digital Logic
Apr 12, 2016
by
Samujjal Das 1
13.3k
views
functional-completeness
24
votes
2
answers
15
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
Arjun
asked
in
Digital Logic
Oct 27, 2014
by
Arjun
6.0k
views
gateit-2008
digital-logic
easy
functional-completeness
21
votes
2
answers
16
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.
Kathleen
asked
in
Digital Logic
Sep 26, 2014
by
Kathleen
2.7k
views
gate1998
digital-logic
functional-completeness
descriptive
34
votes
4
answers
17
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$.
Kathleen
asked
in
Digital Logic
Sep 23, 2014
by
Kathleen
12.0k
views
gate1999
digital-logic
normal
functional-completeness
multiple-selects
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions tagged functional-completeness
Recent Blog Comments
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...