1
Numerical

### GATE CSE 2015 Set 2

The minimum number of $JK$ flip-flops required to construct a synchronous counter with the count sequence $\left( {0,0,1,1,2,2,3,3,0,0,...} \right)$ is ____________.

2
Numerical

### GATE CSE 2015 Set 2

The number of min-terms after minimizing the following Boolean expression is _______________ . $$\left[ {D' + AB' + A'C + AC'D + A'C'D} \right]'$$

3
Numerical

### GATE CSE 2015 Set 2

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____________ .

4
Numerical

### GATE CSE 2015 Set 2

The larger of the two eigenvalues of the matrix $\left[ {\matrix{ 4 & 5 \cr 2 & 1 \cr } } \right]$ is ______.

### Paper Analysis of GATE CSE 2015 Set 2

Subject NameTotal Questions
Algorithms5
Compiler Design3
Computer Networks6
Computer Organization4
Data Structures3
Database Management System4
Digital Logic3
Discrete Mathematics12
Operating Systems4
Programming Languages3
Software Engineering3
Theory of Computation4
Web Technologies1