Better Resource Utilization in Exam Scheduling Using Graph Coloring

Abstract

Time table is required in every school, college, university and various departments. Time table is basically a scheduling to do work or can say is a set of slots to do particular work. Exam scheduling is part of time table problem with bit differences in both like in case of time table problem one lecture can be needed to schedule 3 or more times a week while in exam scheduling one exam is needed to schedule only once. In case of exam scheduling there are two cases, • Student can have exam of two or more subjects consecutively. This type of case is mostly in case of internal exams where syllabus is less. • Student can’t have exam of two or more subjects consecutively. This type of case is mostly in case of final or external exams where syllabus is more. In this thesis it is attempted to do comparison between two ways to schedule exam based on graph coloring approach for both cases mentioned above. The algorithm presented in this paper is divided in four parts: • Graph coloring which is taken from previous build algorithm. • Removal of subject is done if number of students is more than the number of seats available. • Adjustment of subject is done is after removing subjects number of seats remain vacate then subject with less number of students can be adjusted • Next graph is made after removing subjects which are scheduled already. Also an example is explained to show the comparisons of different categories and explain the algorithms.