ExamSIDE
Questions (Powered by ExamGOAL)
Digital Circuits
Number System and Code Convertions
Marks 1Marks 2
Boolean Algebra
Marks 1Marks 2Marks 4Marks 5Marks 10
Logic Gates
Marks 1Marks 2Marks 5Marks 8
Combinational Circuits
Marks 1Marks 2Marks 5Marks 8Marks 10
Sequential Circuits
Marks 1Marks 2Marks 5Marks 8
Semiconductor Memories
Marks 1Marks 2
Logic Families
Marks 1Marks 2Marks 8
Analog to Digital and Digital to Analog Converters
Marks 1Marks 2
Previous Next
1
GATE ECE 1989
MCQ (More than One Correct Answer)
+1
-0
Indicate which of the following logic gates can be used to realize all possible combinational Logic functions:
A
OR gates only.
B
NAND gates only.
C
EX-OR gates only.
D
NOR gates only.
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 32 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
Previous Next
Questions Asked from Marks 1
GATE ECE 2025 (1) GATE ECE 2023 (1) GATE ECE 2016 Set 3 (1) GATE ECE 2016 Set 1 (1) GATE ECE 2015 Set 2 (1) GATE ECE 2015 Set 3 (1) GATE ECE 2014 Set 4 (1) GATE ECE 2013 (1) GATE ECE 2011 (1) GATE ECE 2010 (2) GATE ECE 2002 (1) GATE ECE 2001 (1) GATE ECE 2000 (1) GATE ECE 1997 (1) GATE ECE 1995 (1) GATE ECE 1994 (1) GATE ECE 1993 (2) GATE ECE 1989 (1) GATE ECE 1988 (5)
GATE ECE Subjects
Signals and Systems
Network Theory
Control Systems
Digital Circuits
General Aptitude
Electronic Devices and VLSI
Analog Circuits
Engineering Mathematics
Microprocessors
Communications
Electromagnetics