Loading...

Loading, please wait...

Back

Digital Electronics
Boolean Algebra
K-Map

Questions mapped to K-Map under Boolean Algebra.

3
Total
0
Attempted
0%
0
Correct
0%
0
Incorrect
0%
Q#1 Boolean Algebra GATE EE 2026 (Set 1) MCQ +2 marks -0.66 marks

The digital circuit shown has 3 inputs , and ).

The simplified logical expression for the output (OUT) is:

0

1

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#2 Boolean Algebra GATE EE 2018 (Set 1) MCQ +2 marks -0.66 marks

Digital input signals A, B, C with A as the MSB and C as the LSB are used to realize the Boolean function

, Where to denote the minterm. In addition, F has a don't care for. The simplified expression for F is given by

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#3 Boolean Algebra GATE EE 1995 (Set 1) MCQ +2 marks -0.66 marks

The min-terms of a four variable Boolean function Y is given by  

Use Karnaugh map to minimize the function Y. Realize function Y employing only three-input NAND gates.

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock