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

1. A

   AEHGIFJ

2. B

   ABCDFIJ

3. C

   ABCDIHJ

4. D

   ABECDFJ

5. E

   ABCDIFJ

Select all that apply.

1. A

   Floyd–Warshall algorithm does not work 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 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