ExamSIDE
Questions (Powered by ExamGOAL)
Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
Previous
1
GATE CSE 2006
MCQ (Single Correct Answer)
+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$$
Previous
Questions Asked from Marks 1
GATE CSE 2025 Set 1 (1) GATE CSE 2021 Set 2 (1) GATE CSE 2017 Set 1 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2006 (2)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization