1. Algorithms - Understanding algorithms, flowcharts, sorting methods (bubble, quick), bin-packing, binary search 2. Graphs and Networks - Graph modeling, graph theory, special graph types, representing graphs with matrices 3. Algorithms on Graphs - Kruskal’s and Prim’s algorithms, shortest path algorithms (Dijkstra’s), nearest neighbor method 4. Route Inspection & Travelling Salesman Problem - Eulerian graphs, route inspection, spanning tree methods, upper and lower bound finding 5. Critical Path Analysis - Project modeling, dummy activities, event times, Gantt charts, scheduling diagrams 6. Linear Programming - Optimization problems, graphical methods, integer solutions, locating the optimal point