What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?

I . O(n^2)

II. O(nlogn)

III. O(n^3)

IV. O(n^3.logn)

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

An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE?

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?

Graph traversal is different from a tree traversal, because

Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph?

Dijkstra’s algorithm is based on

What is the time complexity of the brute force algorithm used to solve the Knapsack problem?

Which of the following problems is NOT solved using dynamic programming?

Dijkastra's algorithm is based on which paradigm?

What is the time complexity of Huffman Coding?

What algorithm technique is used in the implementation of Kruskal solution for the MST?

Rather than build a subgraph one edge at a time …………………………. builds a tree one vertex at a time.

Which of the following is not a backtracking algorithm?

Which of the following problems can be solved using recursion?