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
Next
1
GATE ECE 2024
MCQ (Single Correct Answer)
+1
-0.33

For the Boolean function

$F(A, B, C, D) = \sum m(0,2,5,7,8,10,12,13,14,15)$,

the essential prime implicants are _________.

A

$BD$, $\overline{B}~\overline{D}$

B

$BD$, $AB$

C

$AB$, $\overline{B}~\overline{D}$

D

$BD$, $\overline{B}~\overline{D}$, $AB$

2
GATE ECE 2022
MCQ (More than One Correct Answer)
+1
-0

Select the Boolean function(s) equivalent to x + yz, where x, y, and z are Boolean variables, and + denotes logical OR operation.

A
x + z + xy
B
(x + y) (x + z)
C
x + xy + yz
D
x + xz + xy
3
GATE ECE 2018
MCQ (Single Correct Answer)
+1
-0.33
A function F(A, B, C) defined by three Boolean variables A, B and C when expressed as sum of products is given by

F = $$\overline A .\overline B .\overline C + \overline A .B.\overline C + A.\overline B .\overline C $$

where, $$\overline A $$, $$\overline B $$, and $$\overline C $$ are the complements of the respective variables. The product of sums (POS) form of the function F is
A
F = (A + B + C)(A + $$\overline B $$ + C)($$\overline A $$ + B + C)
B
F = ($$\overline A $$ + $$\overline B $$ + $$\overline C $$)($$\overline A $$ + B + $$\overline C $$)(A + $$\overline B $$ + $$\overline C $$)
C
F = (A + B + $$\overline C $$)(A + $$\overline B $$ + $$\overline C $$)($$\overline A $$ + B + $$\overline C $$)($$\overline A $$ + $$\overline B $$ + C)($$\overline A $$ + $$\overline B $$ + $$\overline C $$)
D
F = ($$\overline A $$ + $$\overline B $$ + C)($$\overline A $$ + B + C)(A + $$\overline B $$ + C)(A + B + $$\overline C $$)(A + B + C)
4
GATE ECE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
For an n - variable Boolean function maximum number of prime implicants is
A
2(n-1)
B
n/2
C
$${2^n}$$
D
2$$^{_{(n - 1)}}$$
Next
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