Row Exam Algorithm Design And Software Implementation

Arrangement of the exam is one of the administrations in the university, which is very important and hard to be solved. It means to arrange time, classroom and invigilate for each course in university. And the clash must be largely avoided.In this thesis, the problem of exam-arrangement is introduced. The introduction include the followings: the content, the requirement and the troublesome of this problem. The structures of class, student, course, time, invigilate, classroom and the correlation among them are studied. Based on which we design the data tables. As matter as algorithm, we discussed the retrospect, which is used to solve coloring problem of graph traditionally. Added with the information of clique, the solvent of the problem of exam-arrangement is rendered, and its complexity is also discussed.This system use Excel as the container of the primordial data and the result of computation. At first, we create an Excel file named as exam-arrangement. In which we create 6 sheets named 'student situation'. 'class situation', 'course situation', 'time situation', 'room situation', 'invigilate situation' for each corresponding data, create 2 sheets named 'class-course', 'student-course' for the selection of courses. Create 2 sheets named 'exam-arrangement', and 'examinee-arrange' for the scheme of the computation. In the phrase of the algorithm implement, VBA embed in Excel is used. At first 6 structures are designed for class, student, course, time, room, invigilate. The 7th for arrangement. The arrangement is a such structure, that relied on time and room. In this way, all the information of a single unity is expressed in a single structural viable. With the embedded collections, they can express mult-mult parallelism of relation tables in the program. Before the appointment of the exam-time, 3 functions are designed in order to avoid the clash that may occur. Modular arithmetic is used on collection to produce a scheme of the exam-time. With the change of the parameter we used in modular arithmetic, the program can produce different schemes, each of which relate to a parameter. With the definition and computation of the clash in each scheme. the most receivable scheme is gotten. It can be seen from the result, with the analysis of the structures of the class, student, course, exam-room, and the invigilate, use coloring problem as theory foundation, use collection variable to solve the relation between these bodies. In this way, they can be expressed in the program. Using the user-defined clash function and coefficient, it can avoid the clash, and also use as parameter to evaluate a scheme. we can produce a scheme, in which there are some intervals among all the exam-times each class take.