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 2022
Numerical
+1
-0

Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is __________.

Your input ____
2
GATE CSE 2021 Set 1
Numerical
+1
-0
In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______
Your input ____
3
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
Let G be an undirected complete graph on n vertices, where n > 2. Then, the number of different Hamiltonian cycles in G is equal to
A
n!
B
1
C
(n - 1)!
D
$${{\left( {n - 1} \right)!} \over 2}$$
4
GATE CSE 2018
Numerical
+1
-0
Let $$G$$ be a finite group on $$84$$ elements. The size of a largest possible proper subgroup of $$G$$ is ________.
Your input ____
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