Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
What is the size of the smallest MIS (Maximal Independent Set) of a chain of nine nodes?
A
5
B
4
C
3
D
2
2
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
What is the chromatic number of the following graph? GATE CSE 2008 Discrete Mathematics - Graph Theory Question 68 English
A
$$2$$
B
$$3$$
C
$$4$$
D
$$5$$
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Let $$G$$ be the non-planar graph with minimum possible number of edges. Then $$G$$ has
A
9 edges and 5 vertices
B
9 edges and 6 vertices
C
10 edges and 5 vertices
D
10 edges and 6 vertices
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider a weighted undirected graph with positive edge weights and let $$uv$$ be an edge in the graph. It is known that the shortest path from the source vertex $$s$$ to $$u$$ has weight 53 and the shortest path from $$s$$ to $$v$$ has weighted 65. Which one of the following statements is always true?
A
weight$$(u, v)$$ $$ < 12$$
B
weight$$(u, v)$$ $$ \le 12$$
C
weight$$(u, v)$$ $$ > 12$$
D
weight$$(u, v)$$ $$ \ge 12$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization