1
GATE CSE 2002
Subjective
+2
-0
Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that employs only $$6$$ $$NAND$$ gates each with $$2$$-inputs. GATE CSE 2002 Digital Logic - Boolean Algebra Question 36 English
2
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is
A
$$(x'+z)$$
B
$$x\,y\,z$$
C
$$xy' + \,z$$
D
None of the above
3
GATE CSE 2002
Subjective
+5
-0
Express the function $$f( x, y, z)= xy'+ yz'$$ with only one complement operation and one or more $$AND/OR$$ operations. Draw the logic circuit implementing the expression obtained, using a single NOT gate and one or more $$AND/OR$$ gates.
4
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Minimum $$SOP$$ for $$f(w, x, y, z)$$ shown in karnaugh $$-$$ map below is GATE CSE 2002 Digital Logic - K Maps Question 11 English
A
$$x\,z + y'\,z$$
B
$$x\,z' + z\,x'$$
C
$$x'\,y + z\,x'$$
D
None
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12