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
1
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.
A
xyz
B
$$\overline x $$ $$\overline y $$ $$\overline z $$
C
$$\overline x $$ $$\overline y $$ z + x y $$\overline z $$
D
xy + yz + zx
2
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 GATE ECE 1998 Digital Circuits - Boolean Algebra Question 30 English
A
4
B
5
C
6
D
8
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:
A
2$$^n$$
B
$${2^2}^n$$
C
2$$^{n - 1}$$
D
2$$^{n + 1}$$
Previous
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