General Course Scheduling Application

Abstract Heuristic algorithms have been known to be the most common and effective methods to solving the classical course scheduling problem which has been found to be a nondeterministic polynomial time hard problem. Many software systems have been built on these algorithms to provide a standard and working solution. This paper seeks to look at the gaps of these solutions and propose a newer one which would potentially simplify the process of course scheduling and provide an even more effective solution within the scope of Ghana. This paper provides a course scheduling web application which im…