Examination Scheduling Algorithm Using Graph Colouring: A Case Study of the Departments Information Technology & Cybersecurity, Federal University of Technology, Akure, Nigeria

Examination scheduling in academic institutions represents a complex optimization problem that requires efficient allocation of time slots and venues while minimizing conflicts. This study presents an automated examination scheduling system utilizing graph colouring algorithms to address scheduling challenges in Nigerian universities. A case study of 300-level students in the Cybersecurity and Information Technology departments at the Federal University of Technology, Akure (FUTA) was conducted. The research employed the DSATUR (Degree of Saturation) algorithm to model courses as vertices and student overlaps as edges in an undirected conflict graph. The system was implemented using Python programming language with NetworkX and Matplotlib libraries for graph manipulation and visualization. Results demonstrated successful conflict-free scheduling with optimal time slot allocation, reducing examination periods while satisfying both hard and soft constraints. The automated system generated efficient timetables in approximately 0.67 seconds, eliminating manual scheduling errors and significantly reducing administrative workload. This contribution offers Nigerian educational institutions a scalable and user-friendly solution for examination timetabling, adaptable to varying institutional requirements. Keywords: Examination Scheduling, Graph Colouring, DSATUR Algorithm, Conflict Resolution, Python, Automated Timetabling, FUTA