1
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
2
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.$$
3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Let $$𝑅$$ be the relation on the set of positive integers such that $$aRb$$ if and only if $$𝑎 $$ and $$𝑏$$ are distinct and have a common divisor other than $$1.$$ Which one of the following statements about $$𝑅$$ is true?
A
$$𝑅$$ is symmetric and reflexive but not transitive
B
$$𝑅$$ is reflexive but not symmetric and not transitive
C
$$𝑅$$ is transitive but not reflexive and not symmetric
D
$$𝑅$$ is symmetric but not reflexive and not transitive
4
GATE CSE 2015 Set 2
Numerical
+1
-0
The larger of the two eigenvalues of the matrix $$\left[ {\matrix{ 4 & 5 \cr 2 & 1 \cr } } \right]$$ is ______.
Your input ____
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12