ExamSIDE
Questions (Powered by ExamGOAL)
Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Graph Theory
Marks 1Marks 2Marks 5
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
Calculus
Marks 1Marks 2Marks 5
Previous
1
GATE CSE 1991
Fill in the Blanks
+2
-0
The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .
2
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
A graph is planar if and only if,
A
it does not contain subgraphs homeomorphic to K5 and K3, 3.
B
it does not contain subgraphs isomorphic to K5 or K3, 3.
C
it does not contain subgraphs isomorphic to K5 and K3, 3.
D
it does not contain subgraphs homeomorphic to K5 or K3, 3.
3
GATE CSE 1989
Subjective
+2
-0
Which of the following graphs is / are planar? (see fig.) GATE CSE 1989 Discrete Mathematics - Graph Theory Question 30 English
Previous
Questions Asked from Marks 2
GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (2) GATE CSE 2023 (2) GATE CSE 2022 (4) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (3) GATE CSE 2020 (1) GATE CSE 2019 (1) GATE CSE 2015 Set 2 (2) GATE CSE 2015 Set 1 (2) GATE CSE 2014 Set 3 (2) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (2) GATE CSE 2013 (1) GATE CSE 2012 (2) GATE CSE 2010 (1) GATE CSE 2008 (5) GATE CSE 2007 (2) GATE CSE 2006 (3) GATE CSE 2005 (1) GATE CSE 2004 (4) GATE CSE 2003 (2) GATE CSE 2001 (1) GATE CSE 1995 (1) GATE CSE 1992 (1) GATE CSE 1991 (1) GATE CSE 1990 (1) GATE CSE 1989 (1)
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