Treffer: Analysis of the Use of Backtracking Algorithm in Course Scheduling

In a university study program, course scheduling is an essential procedure to guarantee the effective use of resources, including lecturers and classrooms. The goal of this study is to examine how the Constraint Satisfaction Problem (CSP) Method and the Backtracking Algorithm are used in the scheduling of courses in the State Islamic University of North Sumatra's Computer Science Study Program. Through the assignment of courses to the appropriate time slots, classrooms, and lecturers, this study seeks to maximize the timetable while meeting predefined limits. such include the length of the course, the availability of lecturers, and the size of the classroom.The NetworkX library is used to show the graph-based approach that is being used. utilizing the NetworkX library, in which classrooms, lecturers, and courses are represented by vertices, and the connections between them are represented by edges. The technique By removing incompatible scheduling configurations, this technique effectively lowers the quantity of erroneous configurations. The findings of the study demonstrate that a workable and ideal schedule that minimizes conflicts and satisfies all requirements may be created by employing CSP and backtracking. disputes. This study offers a possible model and advances knowledge of the practical applications of computing techniques like CSP and backtracking in scheduling issues.