1
GATE ECE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
For an n - variable Boolean function maximum number of prime implicants is
2
GATE ECE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
The Boolean expression
(X+Y)(X+$$\overline Y $$)+($$\overline {(X\overline Y ) + \overline X } $$ simplifies to
3
GATE ECE 2013
MCQ (Single Correct Answer)
+1
-0.3
In the sum of products function f (x,y,z) = $$\sum {} $$m (2,3,4,5), the prime implicants are
4
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
Questions Asked from Boolean Algebra (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE ECE Subjects
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
Network Theory
Control Systems
Digital Circuits
General Aptitude
Electronic Devices and VLSI
Analog Circuits
Engineering Mathematics
Microprocessors
Communications
Electromagnetics