1
GATE CSE 2015 Set 2
Numerical
+1
-0
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 ____________.
Your input ____
2
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
A
A tree has no bridges
B
A bridge cannot be part of a simple cycle
C
Every edge of a clique with size $$ \ge 3$$ is a bridge (A clique is any complete sub-graph of a graph )
D
A graph with bridges cannot have a cycle
3
GATE CSE 2015 Set 2
Numerical
+2
-0
Let $$X$$ and $$Y$$ denote the sets containing $$2$$ and $$20$$ distinct objects respectively and $$𝐹$$ denote the set of all possible functions defined from $$X$$ to $$Y$$. Let $$f$$ be randomly chosen from $$F.$$ The probability of $$f$$ being one-to-one is ________.
Your input ____
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is
A
A multiple of $$4$$
B
Even
C
Odd
D
Congruent to $$0$$ $$mod$$ $$4$$, or, $$1$$ $$mod$$ $$4.$$