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 Next
1
GATE CSE 2020
Numerical
+2
-0
Graph G is obtained by adding vertex s to K3,4 and making s adjacent to every vertex of K3,4. The minimum number of colours required to edge-colour G is _____.
Your input ____
2
GATE CSE 2019
MCQ (Single Correct Answer)
+2
-0.67

Let G be any connected, weighted, undirected graph.

I. G has a unique minimum spanning tree, if no two edges of G have the same weight.

II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.

Which of the above two statements is/are TRUE?

A

I only

B

II only

C

Both I and II

D

Neither I nor II

3
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on $$n$$ vertices, $$n$$ is
A
A multiple of $$4$$
B
Even
C
Odd
D
Congruent to $$0$$ $$mod$$ $$4$$, or, $$1$$ $$mod$$ $$4.$$
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+2
-0.6
In a connected graph, bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?
A
A tree has no bridges
B
A bridge cannot be part of a simple cycle
C
Every edge of a clique with size $$ \ge 3$$ is a bridge (A clique is any complete sub-graph of a graph )
D
A graph with bridges cannot have a cycle
Previous Next
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