1
GATE ECE 1998
MCQ (Single Correct Answer)
+1
-0.3
The K-map for a Boolean function is shown in figure. The number of essential prime implicants for this function is
2
GATE ECE 1998
MCQ (Single Correct Answer)
+1
-0.3
Two 2' s complement numbers having sign bits x and y added and the sign bit of the result is z. Then, the occurrence of overflow is indicated by the Boolean function.
3
GATE ECE 1990
MCQ (Single Correct Answer)
+1
-0.3
The number of Boolean functions that can be generated by n variable is equal to:
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