英语论文网

1. List all classes that will be scheduled by class size and duration in a descending sequence. In other words, if there are too many students in this class, then it would be scheduled first. In addition, if a class will run for three hours, then it will also be scheduled first.

检查类的类型，然后以特定的方式，将在以下说明执行计划：

2. Check the class type then execute the schedule in specific way that will be illustrated in the following:
1)Lecture schedule
Check the class duration and group number for this unit then execute one of two ways of schedule according to the group value
Case 1: no group division ( group numberessay is null)
The class schedule will be taken through the following steps:
1.check which lecturer(s) are teaching this class
2.check all lecturers’ convenient time one by one
3.record their common convenient times as a set of candidate time
4.check which students are taking this unit
5.check if all students are convenient with the one of the set of candidate times through checking the time status of students one by one
6.stop checking once it is found that a student is not convenient with the time
7.if the time is not convenient with all students then it will be recorded to remove from the set of candidate time soon
8.repeat step 5-7 to continue check if another time is convenient with all students until all candidate times have been checked
9.check the capacity and type of required room for the class
10.find all rooms that can meet the class demand from database as a set of candidate rooms
11.check one room availability for one candidate time
12.judge if the current room is available at the current one of candidate times
13.Check if there is no available room at the time. If yes, then record the time that will be removed from the set of candidate times soon
14.repeat step 11-13 to continue to check the room availability for next candidate time once all room availabilities have been checked for the time
15.check all times’ priority (Priority means the popularity of the time for students) from database and find the highest one
16.select the time that is in the highest priority as final class time
17.change all lecturers’ time status to be unavailable for the time for the class in the DBMS
18.change all students’ time status to be unavailable for the time for the class in the DBMS
19.insert a record into class details for all students in the DBMS
20.change all students’ lecture status to be scheduled in the DBMS
21.select one from candidate rooms as the final class room
22.change the room availability for the class time to be unavailable in the DBMS
23.end scheduling for the class and return to step 1
 Case 2: group division (group number https://www.51lunwen.org/ukessay/ is not null)
Comparing to case 1, the algorithm difference is in the check of student convenient time. In addition, after the class time is decided, it is required to determine which students will be in this class because not all of students who are taking this unit will be in. The following sections will illustrate the new algorithm for the tw