1. Bin Packing – Calculate a lower bound for containers needed, apply first-fit and first-fit decreasing bin packing algorithms, and perform bubble sort.
2. Dijkstra’s Algorithm – Find the shortest path in a network using Dijkstra’s algorithm, state the route and its length.
3. Minimum Spanning Tree (Kruskal’s Algorithm) – Use Kruskal’s algorithm to find a minimum spanning tree and calculate its total weight.
4. Project Scheduling – Complete early and late event times, draw a cascade chart, and determine the minimum number of workers for a project.
5. Linear Programming – Formulate and solve linear programming problems with constraints and minimize costs.
6. Graph Theory – Analyze weighted graphs using Dijkstra’s algorithm and solve real-world problems involving shortest paths and network routing.