1
GATE CSE 2016 Set 1
+1
-0.3
Let $$G$$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE?

$$P:$$ Minimum spanning tree of $$G$$ does not change
$$Q:$$ Shortest path between any pair of vertices does not change

A
$$P$$ only
B
$$Q$$ only
C
Neither $$P$$ nor $$Q$$
D
Both $$P$$ and $$Q$$
2
GATE CSE 2006
+1
-0.3
Consider a weighted complete graph G on the vertex set {v1, v2, ..vn} such that the weight of the edge (vi, vj) is $$2|i-j|$$. The weight of a minimum spanning tree of G is:
A
n — 1
B
2n — 2
C
$${n \over 2}$$
D
$$n^2$$
3
GATE CSE 2006
+1
-0.3
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:
A
Queue
B
Stack
C
Heap
D
B-Tree
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination