1. Shortest Path (Dijkstra’s Algorithm) – Find the shortest path in a network from A to J and J to A via G. 2. Linear Programming – Formulate a linear programming problem to maximize the sum of angles in a triangle subject to constraints. 3. Minimum Spanning Tree (Prim’s Algorithm) – Use Prim’s algorithm to find the minimum spanning tree and determine upper and lower bounds for a travel route. 4. Bin Packing Algorithms – Apply first-fit and first-fit decreasing bin packing algorithms to allocate parcels to containers and perform bubble sort for list sorting. 5. Project Scheduling – Construct an activity network, calculate early and late event times, and determine the minimum number of workers required to complete a project. 6. Graph Theory – Use Dijkstra’s and Prim’s algorithms to find the shortest routes and optimize travel in a road network.