1
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.
A
0110110...
B
0100100...
C
011101110...
D
011001100...
2
GATE CSE 2015 Set 1
Numerical
+2
-0
$$\sum\limits_{x = 1}^{99} {{1 \over {x\left( {x + 1} \right)}}} $$ = _____________.
Your input ____
3
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Let $${a_n}$$ represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for $${a_n}$$?
A
$$a_{n - 2} + a_{n - 1} + 2^{n - 2}$$
B
$$a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$$
C
$$2a_{n - 2} + a_{n - 1} + 2^{n - 2}$$
D
$$2a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$$
4
GATE CSE 2015 Set 1
Numerical
+2
-0
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is ___________.
Your input ____