Design And Realize Courses Arrangement System Based On Backtracking Algorithm

Course arrangement is one of the most primary, important and complex tasks inuniversity educational administration. The essence of course arrangement is toarrange proper teaching time and space for the course in university so that theteaching process could implement seriously. Course arrangement belongs to acombinational programming problem which constrained to several factors. It couldensure that teacher, student and classroom not to conflict and satisfy the requirementofteachersandclassrooms.Using Visual C++ and access,the system realizes the setting of basal informationby managing database , using backtracking algorithm realize course arragement ofautocoursearragementandmanualcoursearragement,finallyexports theresults,byoperatingthesystemcarriesoutfeasibilityandusabilityofthesystem.Therearethreepartsinthissystem:1.Primaryinformationsetting: It includes class information,teacherinformation,courseinformationandclassroominformation.(1) Teacherinformationsetting:Itteacherinformationcanbemodified,deletedor added,which includes the courses of a teacher ,teacher names ,browsing thecoursesofateacherandupdatingthelistofteachers.(2)Course information setting :User can enroll the courses of thisschool,properties of courses ,and add or deleted courses conveniently in order toupdate the courses list according to the situation of courses which are managed byschool.(3)Class information setting:It can enroll the situation of class and grade settingof the school,and add or deleted the classes or grades in order to update theinformationoftheclasslist.(4)Classroom information setting :The administrator can input the vacantclassrooms which include the name ,address,capacity and also some otherproperties,this makes the arranging and administration of the classroomsconveniently.2.Course arrangement administration: The difficulty in automatic coursearrangement lies in the several constraining conditions and some other uncertainfactors. Course arrangement is constrained by time and space so the course positiononcoursetableisnotunique.Thissystemadoptsbacktrackingalgorithm.Themethodfor backtracking algorithm to solve problem is selecting one possible way to exploit.There are several ways to exploit. It will exploit every possible way. If the way hasproblem it would return. The process of exploiting and returning repeats until it findsthe solution or no solution for the problem. The controlling structure is"returning ifcan not pass". Backtracking algorithm could process complex judgement andcalculationsothattheworkonhumanbrainisdecreased.The layout of courses'sequence has direct relation to success with arranging courses and the rationality of time. So confirming the priority of courses is mostimportant in the layout of courses. Considering the fact of arranging courses, wegiveseveralrulesforconfirmingthepriorityofcoursesasfollows:(1)A required course has precedence over an elective course and a commoncoursetakesprecedenceofarequiredcourse.(2)Thecourseisattemperedfirstwhichhasmoremembers.(3)Thecourseisattemperedfirstwhichhasmoreclasshour.(4)Thecourseisattemperedfirstwhichhasmoreclassweek.(5)Thecourseisattemperedfirstwhichhasspecialrequirementfortime.(6)Thecourseisattemperedfirstwhichhasspecialrequirementfortheclassroom.This system could automatically arrange the universitycommon courses and theadministrator could arrange some other courses if the administrator has set theinformationofuniversityandthedemand. This courseschedulecouldfit theteachingprocessandeducationaladminstrationarragementafterproperlyadjusted.3.Displaying and inquiring: This module could displaythe teacher's informationand the course schedule for teacher, for all university, for class and classroom. Itcould include class-times, teachers, classes, courses and some other optioninformationwhichisonlycombinedbysingleandcompoundquery.Somemeasuresistakentosolvetheproblems:(1)Teacher and administrator have different rights. This system designs differentinterface for administrator and teacher. The administrator could input and modifytheinformation. But the teacher could only query the course schedule and could notmodifythem.(2)Course management. The system designs a time list to record the time that cannot arrange course for some reasons of universities . It will be checked beforearrangeing the course. The time list makes the system flexible and it is helpful toupgradethesysteminfuture(3)Teacher management. Some teachers maybe could not teach in some day. Thesystem designs an exception list to record the daythat some teachers could not teach.It will check this list before arrangeing teachers. The exception list makes thesystemhumanized.(4)Arranging courses automatically or manually.The courses of the school canmainly be divided to 2 types:common courses and majority courses .The commoncourses are opened to all students and the majority courses are opened only to themajority students.So the arranging of the 2 types are different.In order to solve thisproblem ,the system uses Arranging courses automatically or manually.By thisstep,thecollisionbetweenspecialandcommoncanbesolved.The course arrangement system has been applied to university for a term, goingsteadily , data nicety, and operating conveniently and flexibly.The system completesthe designed works and lays a foundation for scientific and modernized educationaladministrationarrangement.