摘要
通过对高校实施学生在校学习年限弹性化以及由此引起的选课问题的分析,提出了关键课程模型。针对大量课程间的复杂关系,提出把这种多对多的关系转化成数据存储中常用的一对一关系。以传统的关键路径算法理论为基础,提出了改进算法,新算法既符合图论的理论,也适用于应用数据库进行数据处理,并解决了关键路径的存储问题。将新算法应用到实际的培养计划制定系统中,对此算法进行检验并得到正确的结果。该算法可以预控学习年限,为希望提前毕业的学生制定合理的培养计划。
Through the analysis of flexible length of schooling in university as well as education scheme, the essential course model is proposed. For the complex relations of massive courses, a method to transform this kind of multi - relations into pair of relations witch is commonly used in data storage is proposed. Take the traditional critical path algorithm theory as a foundation, a new improvement algorithm is designed, the new algorithm already conforms to the graph theory, also is suitable for database manage on the actual data processing, and has solved the critical path storage problem. Appling the new algorithm to the actual educational plan formulation system, it carried out a correct result. This algorithm may control the period of schooling and forms a reasonable plan for students those hope graduates ahead of time or behind of time.
出处
《杭州电子科技大学学报(自然科学版)》
2006年第3期60-64,共5页
Journal of Hangzhou Dianzi University:Natural Sciences
基金
杭州电子科技大学高教研究基金(0534)