| a. Prim's algorithm | i. O(V2E) |
| b. Bellman-Ford algorithm | ii. O(VE lgV) |
| c. Floyd-warshall algorithm | iii. O(E lgV) |
| d. Johnson's algorithm | iv. O(V3) |
Where V is the set of nodes and E is the set of edges in the graph.Codes:
| a | b | c | d | |
| (1) | i | iii | iv | ii |
| (2) | i | iii | ii | iv |
| (3) | iii | i | iv | ii |
| (4) | iii | i | ii | iv |
37. Constructors have _____ return type.
39. Which of the following is a correct statement?
Composition is a strong type of association between two classes with full ownership.
Composition is a strong type of association between two classes with partial ownership.
Composition is a weak type of association between two classes with partial ownership.
Composition is a weak type of association between two classes with strong ownership.0
40. Which of the following is not a correct statement?