志愿分级筛选算法在选课系统中的分析与改进.docVIP

志愿分级筛选算法在选课系统中的分析与改进 　　摘 要:在选课系统中,当同一门课程有多个教学班或要求学生选课必须有多个志愿时,适合使用志愿分级筛选算法。为了使选课过程更加科学化、人性化,对该算法进行了系统的分析,并从选课前准备工作、预选和正选三方面提出了改进措施,从而得到一个实用性更强,更加完善的选课算法。用改进后志愿分级筛选算法设计的选课系统,使优秀的学生可以优先选到自己感兴趣的课程,使选课系统更加人性化,更加适合学生学习的需求。关键词:选课系统; 志愿分级筛选算法; 平均分布概率算法; 权重 　　中图分类号:TN911-34; TP311文献标识码:A 　　文章编号:1004-373X(2010)16-0026-03 　　 　　Improvement of Voluntary Screening Algorithm for Classification in Course-selecting System 　　LI Chun-jie??1,2??, LIU Jie2, LI Dian-kui1, GUO Ji-ping1 　　(1.Commonality Teaching Department of Computer, Jiamusi University, Jiamusi 154007, China; 　　2.College of Computer Science and Technology, Harbin Engineering University, Harbin 154001, China) 　　Abstract: In course-selecting system, the voluntary screening algorithm for classification is suitable for the situation that there is a course with several classes or a student must select more than one courses as he makes selection. The algorithm is analyzed in this paper for making the process of the course selection more scientific and humane. The improvement measures are proposed in three aspects: preparation before course selection, pre-selection and formal selection, which allow the course selection algorithm to be more perfect. The course-selecting system designed with the improved voluntary screening algorithm for classification causes the good students to have priority in course selection to their own interest, and makes the elective system more humane and more appropriate to the students.Keywords: course-selecting system; voluntary screening algorithm for classification; average distribution probabilistic algorithm; weight 　　 　　0 引 言 　　目前在高校中大多都已经实行了选课制,随着网络的普及,网上选课系统的出现,随之而来的选课算法也不断地出现和改进,而且越来越体现出选课的公平和公正性。 　　最简单的先来先服务算法是根据选课时间的先后进行选课操作,当选课人数达到最大限选人数时即结束;若学生为了选到自己喜欢的课都在同一时间段内进行选课,容易造成网络拥堵,而且由于网速的问题也可能出现学生先选的不一定先得到服务[1]。抽签算法主要用于处理选课人数超过限选人数的情况。对于抽签算法,抽签的方法又不尽相同,总结起来有随机抽取、按权重高低抽取和各种优先排列抽取等[2]。目前常用的优先排列抽取主要有专业优先算法,成绩优先算法,按名额分配比例算法,志愿分级筛选算法等。长期实践表明,不同的算法各有其优缺点,适合于不同的选课处理。 　　由于学生每学期的权重值区分不大,按权