NIMCET 2027 Boolean Algebra Previous Year Questions (PYQs) – Page 4 of 4

NIMCET 2027 Boolean Algebra Previous Year Questions (PYQs) – Page 4 of 4

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Reset
Showing 36 questions
logo
🎓 NIMCET📅 Year: 2022📚 Computer🏷 Boolean algebra

If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):

1
2
3
4

logo
🎓 NIMCET📅 Year: 2010📚 Computer🏷 Boolean algebra

Simplified form of $F(X,Y,Z)=\Sigma(0,2,4,5,6)$ is:

1
2
3
4

logo
🎓 NIMCET📅 Year: 2016📚 Computer🏷 Boolean algebra

The number of terms in the product of sums canonical form of  is

1
2
3
4

logo
🎓 NIMCET📅 Year: 2016📚 Computer🏷 Boolean algebra

Consider the following min term expression for F.
F(P,Q,R,S) = ∑ (0, 2, 5, 7, 8, 10, 13, 15)
The minterms 2, 7, 8 and 13 are ‘do not care' terms. 
The minimal sum of products form for F is

1
2
3
4

logo
🎓 NIMCET📅 Year: 2016📚 Computer🏷 Boolean algebra

The Boolean expression represented by the following Venn diagram is


1
2
3
4

logo
🎓 NIMCET📅 Year: 2018📚 Computer🏷 Boolean algebra

Which one of the following expression does NOT represent exclusive NOR of x and y?

1
2
3
4

NIMCET 2027


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

NIMCET 2027


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

loading...