Home › Previous year questions › GATE 2008 CS › Question 5GATE 2008 CS – Question 5 Digital Logic · Boolean Algebra and Minimization · 1 mark · Multiple choice
In the shown Karnaugh map, X denotes a don’t-care. Find the minimal function.
$\bar b\bar d+\bar a\bar d$ $\bar a\bar b+\bar b\bar d+\bar a b\bar d$ $\bar b\bar d+\bar a b\bar d$ $\bar a\bar b+\bar b\bar d+\bar a\bar d$ Practise this question in The GATE Grind →
Show answer and explanation Correct answer: (A) $\bar b\bar d+\bar a\bar d$
Explanation We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Boolean Algebra and Minimization questions GATE 2008 CS Q8 – For the circuit shown, f 1= m(4,5,6,7,8), f 3= m(1,6,15) and f= m(1,6,8,15). What is f 2? GATE 2008 CS Q26 – Simplify (P+ Q)(P Q+PR)( P R+ Q). GATE 2007 CS Q3 – What maximum number of different Boolean functions involve n Boolean variables? GATE 2007 CS Q9 – For f(w,x,y,z)=(1,3,4,6,9,11,12,14), the function is GATE 2007 CS Q32 – Let f(w,x,y,z)=(0,4,5,7,8,9,13,15). Which expressions are NOT equivalent to f? P. x y z+w… GATE 2007 CS Q33 – Define X*Y=XY+X Y. Let Z=X*Y. Which are valid? P: X=Y*Z; Q: Y=X*Z; R: X*Y*Z=1. All Boolean Algebra and Minimization questions →