Time Left - 15:00 mins
GATE 2019 - Algorithms Quiz-6 (Greedy Algo )
Attempt now to get your rank among 720 students!
Question 1
Which of the following statement is false?
Question 2
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered.
Question 3
Dijkstra’s single source shortest path algorithm when run from vertex a in the above graph, computes the correct shortest path distance to
Question 4
Consider the following graph:
Which one of the following cannot be the sequence of edges added, in that order, to aminimum spanning tree using Kruskal’s algorithm?
Which one of the following cannot be the sequence of edges added, in that order, to aminimum spanning tree using Kruskal’s algorithm?
Question 5
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
Question 6
aaaabbbccddddddddee
What will be the maximum length of prefix code used for above sequence of letter in Huffman coding?
- 720 attempts
- 2 upvotes
- 4 comments
Tags :
GATE & PSU CSAlgorithmsJun 25GATE & PSU CS