1
GATE CSE 2007
+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
2
GATE CSE 2007
+2
-0.6
Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w . Which of the following is FALSE?
A
There is a minimum spanning tree containing e.
B
If e is not in a minimum spanning tree T, then in the cycle formed by adding e to T, all edges have the same weight.
C
Every minimum spanning tree has an edge of weight w .
D
e is present in every minimum spanning tree.
3
GATE CSE 2007
+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. What is the average length of Huffman codes?
A
3
B
2.1875
C
2.25
D
1.9375
4
GATE CSE 2007
+2
-0.6
In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by
A
Dijkstra’s algorithm starting from S.
B
Warshall’s algorithm
C
Performing a DFS starting from S.
D
Performing a BFS starting from S.
GATE CSE Subjects
EXAM MAP
Medical
NEET