×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:
2.
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
3.
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
4.
Which of the following algorithm can be used to efficiently calculate single source shortest paths in a Directed Acyclic Graph?
5.
Given a directed graph where weight of every edge is same, we can efficiently find shortest path from a given source to destination using?
6.
The length of the path from v5 to v6 in the MST of previous question with n = 10 is
7.
In the graph given in above question question, 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?
8.
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is: (GATE CS 2005)
9.
Given 8 identical coins out of which one coin is heavy and a pan balance. How many minimum number of measurements are needed to find the heavy coin?