Maths 1 End Term: 24 December 2023, Set FDF1 (September 2023 term)

Select all that apply.

1. A

   Floyd–Warshall algorithm works for graphs with negative weight cycles.

2. B

   Floyd-Warshall algorithm is used for all pair shortest paths.

3. C

   The Shortest path problem is not applicable to a graph with a negative weight cycle.

4. D

   Bellman-Ford algorithm is used for single source shortest path.

5. E

   Dijkstra’s algorithm is used for all pair shortest paths.

Select all that apply.

1. A

2. B

3. C

4. D

Select all that apply.

1. A

2. B

3. C

4. D