Digital Logic
Boolean Algebra
Marks 1Marks 2Marks 5
Combinational Circuits
Marks 1Marks 2
Number Systems
Marks 1Marks 2
Sequential Circuits
Marks 1Marks 2Marks 5
1
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Given the function $$F = P′ + QR,$$ where $$F$$ is a function in three Boolean variables $$P,Q$$ and $$R$$ and $$P'=!P,$$ consider the following statements.

$$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S1} \right)\,\,\,\,F = \sum {\left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S2} \right)\,\,\,\,F = \sum {\left( {0,1,2,3,7} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S3} \right)\,\,\,\,F = \sum {\Pi \left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S4} \right)\,\,\,\,F = \sum {\Pi \left( {0,1,2,3,7} \right)} \cr} $$

Which of the following is true?

A
$$(S1)$$- False, $$(S2)$$- True, $$(S3)$$- True, $$(S4)$$- False
B
$$(S1)$$- True, $$(S2)$$- False, $$(S3)$$- False, $$(S4)$$- True
C
$$(S1)$$- False, $$(S2)$$- False, $$(S3)$$- True, $$(S4)$$- True
D
$$(S1)$$- True, $$(S2)$$- True, $$(S3)$$- False, $$(S4)$$- False
2
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 ____
3
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 ____
4
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6

Consider the operations

$$f\left( {x,y,z} \right) = X'YZ + XY' + Y'Z'$$ and
$$g\left( {x,y,z} \right) = X'YZ + X'YZ' + XY$$.

Which one of the following is correct?

A
Both $$\left\{ f \right\}$$ and $$\left\{ g \right\}$$ are functionally complete
B
Only $$\left\{ f \right\}$$ is functionally complete
C
Only $$\left\{ g \right\}$$ is functionally complete
D
Neither $$\left\{ f \right\}$$ nor $$\left\{ g \right\}$$ is functionally complete
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization