The Research And Implementation Of Arranging Course System Based On Greedy Arithmetic

Nowadays, with widely use of the computer and the quick development of Internet, many teaching management systems have being used in succession in domestic universities. However, in the actual researching project, arranging course is a NP proplem. It is difficult to develop a good arranging course system for user.Aimed at the problem of reseaching and running of arranging course system, I try to use greedy arithmetic to research and solve the problem. Greedy arithmetic gets going from an initial solution to problem, through a series of greeding chosen which is best chosen at currently status, and it gets the aim step by step, hope to get the better solution as possible as it can. When it reaches a step can not resumption, the arithmetic will stop. Greedy arithmetic want to get the best solution step by step, at every step, it will make a decision that seem to best.Based that theory, aimed at arranging course system that developed by the center of computer engineering research and development in GuangDong university of technology, refer to the arranging course algorithmic of literature and the actual requirement of user, based the greedy arithmetic and resource matching method, use dynamic memory distributing best adapting method to develop. At last, we had desiged and implement the arranging course system. At the test of running, the response time and the result of system had reached satisfaction, it can spead to development and implement of other teaching management system.At last, the thesis does the summary to itself, elaborate the work of the thesis, and point out the direction of further research.