Its algorithm guarantees that the student will have the most optimal schedule to fulfill degree requirement in least semesters according to the current available academic information and course availability information. At the beginning of each semester, the academic advisor will not need to work on each student s different academic situation to figure out course suggestion for the new semester. Academic advisor only needs to give the suggestion of elective courses which student should take to fulfill the degree requirement. The system will utilize the algorithm called Conditional Optimal Sorting of AOV network to generate the most optimal schedule for the student. Figure 1 shows the information flow of the system.
Diamonds represent actions that process information flows-in and gives out processing result.
So the entire procedures involve three steps. Figure 2 shows the detail of Conditionally Optimal Sorting of AOV network with limited uncertainty. The algorithm will choose courses, from the availability of consecutive semesters, which can qualify most other courses. For example, in spring semester, CS401 and CS403 are available and both are to be taken. However, only one more course is allowed.