摘要
为了解决高校灵活多样地选课带来的排考问题,在以往以班级为单位的排考基础上,结合高校实际情况进行分析和拓展,提出了一种新的排考问题中时间点的安排算法。该算法易实现且计算效率高,有效地解决此类排考中的问题。
To solve the problem of arranging the exam-arrangement which is difficult due to its uncontrollable randomization,a new algorithm based on the previous way and combined with college actual situation is proposed.It is proved that the algorithm is effective and its time complexity is simple.
作者
姚徐
姚双良
孙惠琴
YAO Xu,YAO Shuang-liang,SUN Hui-qin（Dean＇s Office,Jiangsu University of Science and Technology,Zhenjiang 212003,China）
出处
《电脑知识与技术》
2011年第5期3200-3201,3207,共3页
Computer Knowledge and Technology
关键词
排考
冲突
算法
arranging time number of examination
collision
algorithm
