1
GATE CSE 2015 Set 2
Numerical
+2
-0
A half adder is implemented with $$XOR$$ and $$AND$$ gates. A full adder is implemented with two half adders and one $$OR$$ gate. The propagation delay of an $$XOR$$ gate is twice that of an $$AND/OR$$ gate. The propagation delay of an $$AND/OR$$ gate is $$1.2$$ microseconds. A $$4$$-bit ripple-carry binary adder is implemented by using four full adders. The total propagation time of this $$4$$-bit binary adder in microseconds is____________ .
Your input ____
2
GATE CSE 2015 Set 2
Numerical
+2
-0
The number of min-terms after minimizing the following Boolean expression is _______________ . $$$\left[ {D' + AB' + A'C + AC'D + A'C'D} \right]'$$$
Your input ____
3
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Let $$ \oplus $$ denote the exclusive $$OR\left( {XOR} \right)$$ operation. Let $$'1'$$ and $$'0'$$ denote the binary constants. Consider the following Boolean expression for $$F$$ over two variables $$P$$ and $$Q$$:
$$F\left( {P,Q} \right) = \left( {1 \oplus P} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {Q \oplus 0} \right)$$

The equivalent expression for $$F$$ is

A
$$P+Q$$
B
$$\overline {P + Q} $$
C
$${P \oplus Q}$$
D
$$\overline {P \oplus Q} $$
4
GATE CSE 2010
MCQ (Single Correct Answer)
+2
-0.6
What is the Boolean expression for the output f of the combinational logic circuit of NOR gates given below? GATE CSE 2010 Digital Logic - Boolean Algebra Question 32 English
A
$$\overline {Q + R} $$
B
$$\overline {P + Q} $$
C
$$\overline {P + R} $$
D
$$\overline {P+Q + R} $$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP