1
GATE CSE 2010
MCQ (Single Correct Answer)
+2
-0.6
Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W(ij) in the matrix W below is the weight of the edge {i, j}. $$$w = \left( {\matrix{ 0 & 1 & 8 & 1 & 4 \cr 1 & 0 & {12} & 4 & 9 \cr 8 & {12} & 0 & 7 & 3 \cr 1 & 4 & 7 & 0 & 2 \cr 4 & 9 & 3 & 2 & 0 \cr } } \right)$$$ What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?
A
7
B
8
C
9
D
10
2
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider the following graph: GATE CSE 2009 Algorithms - Greedy Method Question 20 EnglishWhich one of the following is NOT the sequence of edges added to the minimum spanning tree using Kruskal’s algorithm?
A
(b,e)(e,f)(a,c)(b,c)(f,g)(c,d)
B
(b,e)(e,f)(a,c)(f,g)(b,c)(c,d)
C
(b,e)(a,c)(e,f)(b,c)(f,g)(c,d)
D
(b,e)(e,f)(b,c)(a,c)(f,g)(c,d)
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
GATE CSE 2008 Algorithms - Greedy Method Question 21 English Dijkstra's single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance to
A
only vertex a
B
only vertices a,e,f,g,h
C
only vertices a,b,c,d
D
all the vertices
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?
A
0, 10, 110, 1110, 11110, 11111
B
11, 10, 011, 010, 001, 000
C
11, 10, 01, 001, 0001, 0000
D
110, 100, 010, 000, 001, 111
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12