Topic List

 Sorting  Dynamic Programming  Recursion  Binary Trees  Abstract Data Types  Graph  Searching  Heap  Trees  Hash Tables  Stacks  Cryptography  Number Theory  Shortest Path  Graph Search  Arrays  Algorithms  Computational Geometry  Miscellaneous  Complexity Classes  Matching  Backtracking  Trie  Bipartite Graphs  Lists  Flow Problem  B-Trees  String Matching  Minimum Cut

Shortest Path on Data Structure and Algorithms related Questions and Answers - Page 7

Question 61 : How many solution/solutions are available for a graph having negative weight cycle?
1. One solution
2. Two solutions
3. No solution
4. Infinite solutions
View Answer   Discuss with Members

Question 62 : What is running time of Dijkstra's algorithm using Binary min- heap method?
1. O(V)
2. O(VlogV)
3. O(E)
4. O(ElogV)
View Answer   Discuss with Members

Question 63 : The time taken to compute the transitive closure of a graph is Theta(n2).
1. True
2. False
3.
4.
View Answer   Discuss with Members


View 61 - 63 of 63 Questions

* Be the First to Post a Comment.

Submit comment :

Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter