1

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

2

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 ____

3

GATE CSE 2018

Numerical

+2

-0

Consider the weights and values of items listed below. Note that there is only one unit of each item.

Item number | Weight (in Kgs) |
Value (in Rupees) |
---|---|---|

1 | 10 | 60 |

2 | 7 | 28 |

3 | 4 | 20 |

4 | 2 | 24 |

The task is to pick a subset of these items such that their total weight is no more than $$11$$ $$Kgs$$ and their total value is maximized. Moreover, no item may be split. The total value of items picked by an optimal algorithm is denoted by $$V$$_{opt}. A greedy algorithm sorts the items by their value-to-weight ratios in descending order and packs them greedily, starting from the first item in the ordered list. The total value of items picked by the greedy algorithm is denoted by $$V$$_{greedy}.

The value of $$V$$_{opt} $$−$$ $$V$$_{greedy} is ____________.

Your input ____

4

GATE CSE 2018

Numerical

+2

-0

Consider the following undirected graph $$G: $$

Choose a value for $$x$$ that will maximize the number of minimum weight spanning trees $$(MWSTs)$$ of $$G.$$ The number of $$MWSTs$$ of $$G$$ for this value of $$x$$ is ______.

Your input ____

Questions Asked from Greedy Method (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2020 (2)
GATE CSE 2018 (2)
GATE CSE 2016 Set 1 (2)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 1 (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

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages