1
GATE CSE 2014 Set 1
Numerical
+1
-0
The maximum number of edges in a bipartite graph on $$12$$ vertices is _________.
2
GATE CSE 2013
+1
-0.3
Consider an undirected random$$^ \circ$$ graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
A
$$1/8$$
B
$$1$$
C
$$7$$
D
$$8$$
3
GATE CSE 2013
+1
-0.3
Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
A
P only
B
Q only
C
Both P and Q
D
Neither P and Q
4
GATE CSE 2012
+1
-0.3
Let G be a simple undirected planner graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
A
3
B
4
C
5
D
6
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination