1
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 ____
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
$$G = (V,E)$$ is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees $$(MSTs)$$ of $$G$$ is/are TRUE?

$$\,\,\,\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,\,\,\,$$ If $$e$$ is the lightest edge of some cycle in $$G,$$ then every $$MST$$ of $$G$$
$$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$includes $$e$$
$$\,\,\,\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,\,\,\,$$ If $$e$$ is the heaviest edge of some cycle in $$G,$$ then every $$MST$$ of $$G$$
$$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$excludes $$e$$

A
$${\rm I}$$ only
B
$${\rm I}$$$${\rm I}$$ only
C
both $${\rm I}$$ and $${\rm II}$$
D
neither $${\rm I}$$ nor $${\rm I}$$$${\rm I}$$
3
GATE CSE 2016 Set 1
Numerical
+2
-0
Consider the weighted undirected graph with $$4$$ vertices, where the weight of edge $$\left\{ {i,j} \right\}$$ is given by the entry $${W_{ij}}$$ in the matrix $$W.$$ $$$W = \left[ {\matrix{ 0 & 2 & 8 & 5 \cr 2 & 0 & 5 & 8 \cr 8 & 5 & 0 & X \cr 5 & 8 & X & 0 \cr } } \right]$$$

The largest possible integer value of $$x,$$ for which at least one shortest path between some pair of vertices will contain the edge with weight $$x$$ is _________________.

Your input ____
4
GATE CSE 2015 Set 1
Numerical
+2
-0
The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is ___________. GATE CSE 2015 Set 1 Algorithms - Greedy Method Question 17 English
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12