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 2002
MCQ (Single Correct Answer)
+1
-0.3
Maximum number of edges in a n - node undirected graph without self loops is
A
$${n^2}$$
B
$$n\left( {n - 1} \right)/2$$
C
$$n - 1$$
D
$$\left( {n + 1} \right)\left( n \right)/2$$
2
GATE CSE 1994
MCQ (Single Correct Answer)
+1
-0.3
The number of distinct simple graph with upto three nodes is
A
15
B
10
C
7
D
9
3
GATE CSE 1992
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is/are tautology?
A
$$\left( {a \vee b} \right) \to \left( {b \wedge c} \right)$$
B
$$\left( {a \wedge b} \right) \to \left( {b \vee c} \right)$$
C
$$\left( {a \vee b} \right) \to \left( {b \to c} \right)$$
D
$$\left( {a \to b} \right) \to \left( {b \to c} \right)$$
4
GATE CSE 1992
MCQ (Single Correct Answer)
+1
-0.3
A non-planar graph with minimum number of vertices has
A
9 edges, 6 vertices
B
6 edges, 4 vertices
C
10 edges, 5 vertices
D
9 edges, 5 vertices
Previous
Questions Asked from Marks 1
GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2022 (2) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2018 (2) GATE CSE 2016 Set 2 (1) GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 1 (2) GATE CSE 2013 (2) GATE CSE 2012 (1) GATE CSE 2011 (1) GATE CSE 2010 (1) GATE CSE 2009 (2) GATE CSE 2008 (2) GATE CSE 2007 (4) GATE CSE 2006 (2) GATE CSE 2005 (2) GATE CSE 2004 (1) GATE CSE 2003 (1) GATE CSE 2002 (1) GATE CSE 1994 (1) GATE CSE 1992 (2)
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