1. Binary Search Algorithm—locating a word in an ordered list using binary search, rejecting sections of the list at each stage. 2. Linear Programming—formulating a problem to minimize pizza production costs, including constraints on the number of pizzas (small vs large), and maximizing efficiency. 3. Bin Packing Algorithms—using first-fit bin packing to arrange numbers into bins, followed by bubble sort and quick sort to optimize placement. 4. Traveling Salesperson Problem—using nearest neighbour and Prim’s algorithm to estimate upper and lower bounds for travel distances between locations. 5. Graph Theory and Dijkstra’s Algorithm—finding the shortest path in a network, comparing route lengths for different starting points. 6. Project Scheduling and Resource Allocation—using activity networks to calculate critical paths, worker requirements, and project completion strategies.