1
GATE ECE 2013
+1
-0.3
In the sum of products function f (x,y,z) = $$\sum {}$$m (2,3,4,5), the prime implicants are
A
$$\overline X \,Y,X\overline Y$$
B
$$\overline X \,Y,X\overline Y$$$$\overline Z ,X\overline Y Z$$
C
$$\overline X Y\overline Z$$,$$\overline X YZ,X\overline Y$$
D
$$\overline X Y\overline Z$$ ,$$\overline X YZ,X\overline Y$$$$\overline Z ,X\overline Y Z$$
2
GATE ECE 2007
+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
A
2
B
3
C
4
D
5
3
GATE ECE 2006
+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) A
2
B
3
C
4
D
5
4
GATE ECE 2005
+1
-0.3
The Boolean expression for the truth table shown is
A B C D
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 0
A
B(A+C)($$\overline A + \overline C )$$
B
$$B\left( {A + \overline C } \right)\left( {\overline A + C} \right)$$
C
$$\overline B$$(A+$$\overline C$$)($$\overline A$$+C)
D
$$\overline B$$(A+C)(($$\overline A + \overline C )$$
GATE ECE Subjects
Network Theory
Control Systems
Electronic Devices and VLSI
Analog Circuits
Digital Circuits
Microprocessors
Signals and Systems
Communications
Electromagnetics
General Aptitude
Engineering Mathematics
EXAM MAP
Joint Entrance Examination