{'fraction_non_alphanumeric': 0.016488845780795344, 'fraction_numerical': 0.0, 'mean_word_length': 5.035087719298246, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Graph Coloring based Scheduling Algorithm to automatically generate College Course Timetable

Time table scheduling has been a topic of research in the past decades, yet, not a single optimal robust algorithm has been developed which can dynamically solve this problem considering all hard as well as some soft constraints. The manual way of doing it is very time-consuming, and even after generating a timetable, no one can guarantee that it is the best schedule. The automated timetable scheduling belongs to the NP-Complete class of problem, and hence it is not easy to solve. As academic institutes are growing in number and complexity, their resources and events are becoming harder to schedule, therefore to overcome all these problems, this paper proposes to make an algorithm which will consider all required constraints from both the students and teachers’ point of view. The main aim of the proposed algorithm is to provide a conflict-free and practically feasible schedule with optimized use of every resource available.