Answer: E Explanation: Topological sort of DAG takes (V+E) time. Bellman ford single source shortest path takes O(VE) time Floyd Warshall’s all pair shortest path algorithm takes O(V3) time. Kruskal’s algorithm: Sorted edges will take O(ElogV) and unsorted edges will take O(ElogE)
Question 2 UGC NET June-2020  If algorithm A and another algorithm B take log2(n) and √n microseconds, respectively, to solve a problem, then the largest size n of a problem these algorithms can solve, respectively, in one second are______ and __.
