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 2007
MCQ (Single Correct Answer)
+1
-0.3
The Boolean function Y=AB+CD is to be realized using only 2-input NAND gates. The minimum number of gates required is
A
2
B
3
C
4
D
5
2
GATE ECE 2006
MCQ (Single Correct Answer)
+1
-0.3
The number of product terms in the minimized sum-of-product expression obtained through the following k-map is ( where , "d" denotes don't care states) GATE ECE 2006 Digital Circuits - Boolean Algebra Question 26 English
A
2
B
3
C
4
D
5
3
GATE ECE 2005
MCQ (Single Correct Answer)
+1
-0.3
The Boolean expression for the truth table shown is
A B C D
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0
A
B(A+C)($$\overline A + \overline C )$$
B
$$B\left( {A + \overline C } \right)\left( {\overline A + C} \right)$$
C
$$\overline B $$(A+$$\overline C $$)($$\overline A $$+C)
D
$$\overline B $$(A+C)(($$\overline A + \overline C )$$
4
GATE ECE 2003
MCQ (Single Correct Answer)
+1
-0.3
The number of distinct Boolean expressions of 4 variables is
A
16
B
256
C
1024
D
65536
Previous Next
Questions Asked from Marks 1
GATE ECE 2024 (1) GATE ECE 2022 (1) GATE ECE 2018 (1) GATE ECE 2014 Set 2 (1) GATE ECE 2014 Set 1 (1) GATE ECE 2013 (1) GATE ECE 2007 (1) GATE ECE 2006 (1) GATE ECE 2005 (1) GATE ECE 2003 (1) GATE ECE 1999 (1) GATE ECE 1998 (2) GATE ECE 1990 (1)
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