1

GATE CSE 2024 Set 2

MCQ (More than One Correct Answer)

+2

-0.66

Let $G$ be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in $G$ has **even** weight. Which of the following statements is/are TRUE for **every** such graph $G$?

2

GATE CSE 2024 Set 2

Numerical

+2

-0.66

The number of distinct minimum-weight spanning trees of the following graph is ________

Your input ____

3

GATE CSE 2020

MCQ (Single Correct Answer)

+2

-0.67

Let G = (V, E) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighted edge (u, v) $$ \in $$ V $$ \times $$ V is added to G. The worst case time complexity of determining if T is still an MST of the resultant graph is

4

GATE CSE 2020

Numerical

+2

-0.67

Consider a graph G = (V, E), where V = {v

E = {(v

_{1}, v_{2}, ...., v_{100}},E = {(v

_{i}, v_{j}) | 1 ≤ i < j ≤ 100}, and weight of the edge (v_{i}, v_{j}) is |i - j|. The weight of the minimum spanning tree of G is ______.Your input ____

Questions Asked from Greedy Method (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (2)
GATE CSE 2020 (2)
GATE CSE 2018 (2)
GATE CSE 2016 Set 1 (2)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 2 (2)
GATE CSE 2012 (1)
GATE CSE 2011 (2)
GATE CSE 2010 (2)
GATE CSE 2009 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (4)
GATE CSE 2006 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (3)
GATE CSE 2000 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (2)

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