1
GATE ECE 1988
MCQ (Single Correct Answer)
+1
-0.3
Minimum number of 2-input NAND gates required to implement the function, f=($$\overline X $$+$$\overline Y $$)(Z+W) is
A
3
B
4
C
5
D
6
2
GATE ECE 1988
MCQ (Single Correct Answer)
+1
-0.3
For the circuit shown below the output Fis given by GATE ECE 1988 Digital Circuits - Logic Gates Question 30 English
A
F=1
B
F=0
C
F=X
D
F= $$\overline X $$
3
GATE ECE 1988
MCQ (Single Correct Answer)
+1
-0.3
The minimum number of 2-input NAND gates required to implement the Boolean function Z=A$$\overline {B\,} $$C, assuming that A, B and C are available, is
A
two
B
three
C
five
D
six
4
GATE ECE 1988
MCQ (Single Correct Answer)
+1
-0.3
The Boolean function A+BC is a reduced form of
A
AB+BC
B
(A+B).(A+C)
C
$$\overline A $$B+A$$\overline B $$ C
D
(A+C).B
GATE ECE Subjects
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12