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
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)
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 |
4
GATE ECE 2003
MCQ (Single Correct Answer)
+1
-0.3
The number of distinct Boolean expressions of 4 variables is
Questions Asked from Boolean Algebra (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE ECE Subjects
Network Theory
Control Systems
Electronic Devices and VLSI
Analog Circuits
Digital Circuits
Microprocessors
Signals and Systems
Representation of Continuous Time Signal Fourier Series Discrete Time Signal Fourier Series Fourier Transform Discrete Time Signal Z Transform Continuous Time Linear Invariant System Transmission of Signal Through Continuous Time LTI Systems Discrete Time Linear Time Invariant Systems Sampling Continuous Time Signal Laplace Transform Discrete Fourier Transform and Fast Fourier Transform Transmission of Signal Through Discrete Time Lti Systems Miscellaneous Fourier Transform
Communications
Electromagnetics
General Aptitude