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 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
3
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
4
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 Subjects
Browse all chapters by subject
General Aptitude
Network Theory
Microprocessors
Signals and Systems
Discrete Time Signal Fourier Series Fourier Transform Continuous Time Signal Laplace Transform Fourier Transform Discrete Fourier Transform and Fast Fourier Transform Representation of Continuous Time Signal Fourier Series Discrete Time Linear Time Invariant Systems Transmission of Signal Through Continuous Time LTI Systems Transmission of Signal Through Discrete Time Lti Systems Miscellaneous Continuous Time Linear Invariant System Discrete Time Signal Z Transform Sampling
Electromagnetics
Digital Circuits
Electronic Devices and VLSI
Control Systems
Communications
Engineering Mathematics