1

GATE CSE 2021 Set 1

MCQ (More than One Correct Answer)

+2

-0.67

An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components.

Let T be a DFS tree obtained by doing DFS in a connected undirected graph G. Which of the following option is/are correct?

2

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

+2

-0.67

Let G be a group order 6, and H be a subgroup of G such that 1 < |H| < 6. Which one of the following options is correct?

3

GATE CSE 2021 Set 1

Numerical

+2

-0.67

In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is ______

Your input ____

4

GATE CSE 2020

Numerical

+2

-0.67

Graph G is obtained by adding vertex s to K

_{3,4}and making s adjacent to every vertex of K_{3,4}. The minimum number of colours required to edge-colour G is _____.Your input ____

Questions Asked from Graph Theory (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2021 Set 1 (3)
GATE CSE 2020 (1)
GATE CSE 2015 Set 2 (2)
GATE CSE 2015 Set 1 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (2)
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

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude