A Streamlining University Examination Scheduling: Leveraging Kruskal's Algorithm and Z Specification for Efficiency

Abstract

Automating the examination scheduling process in universities is essential to streamline operations and reduce manual effort. This paper addresses the challenges of manual scheduling, such as time consumption, paper usage, and human effort. The goal is to efficiently schedule exams within a limited timeframe, ensuring no conflicts and adhering to constraints. Traditional methods are impractical for final examinations due to the growing number of students and courses. Various search algorithms can be employed for scheduling, including Kruskal's Algorithm, which this paper focuses on. The system's description and specification will use the Z specification language for formal analysis. Additionally, the Unified Modeling Language (UML) diagrams will visualize the system's architecture and design, using use case, class, sequence, and activity diagrams to represent functionality, structure, and behavior. This combination offers a robust framework for an effective and reliable examination scheduling system.