Question
a.
NOT gate
b.
NOR gate
c.
AND gate
d.
NAND gate
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Inversion of single bit input to a single bit output using _________
Similar Questions
Discover Related MCQs
Q. There are _________ numbers of Boolean functions of degree n.
View solution
Q. A _________ is a Boolean variable.
View solution
Q. Minimization of function F(A,B,C) = A*B*(B+C) is _________
View solution
Q. The set for which the Boolean function is functionally complete is __________
View solution
Q. (X+Y`)(X+Z) can be represented by _____
View solution
Q. __________ is a disjunctive normal form.
View solution
Q. a ⊕ b = ________
View solution
Q. Find the simplified expression A’BC’+AC’.
View solution
Q. Evaluate the expression: (X + Z)(X + XZ’) + XY + Y.
View solution
Q. Simplify the expression: A’(A + BC) + (AC + B’C).
View solution
Q. What is the simplification value of MN(M + N’) + M(N + N’)?
View solution
Q. Simplify the expression XZ’ + (Y + Y’Z) + XY.
View solution
Q. Find the simplified term Y’ (X’ + Y’) (X + X’Y)?
View solution
Q. If an expression is given that x+x’y’z=x+y’z, find the minimal expression of the function F(x,y,z) = x+x’y’z+yz?
View solution
Q. Simplify the expression: XY’ + X’ + Y’X’.
View solution
Q. Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.
View solution
Q. Minimize the following Boolean expression using Boolean identities.
F(A,B,C) = (A+BC’)(AB’+C)
View solution
Q. K-map is used for _______
View solution
Q. To display time in railway stations which digital circuit is used?
View solution
Q. Simplify the expression using K-maps: F(A,B,C,D)=Σ (1,3,5,6,7,11,13,14).
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!