首页 | 本学科首页   官方微博 | 高级检索  
     

学分制下排课的数据组织与算法
引用本文:李端明,李宇翔.学分制下排课的数据组织与算法[J].计算机工程与设计,2006,27(19):3709-3712.
作者姓名:李端明  李宇翔
作者单位:西南科技大学,经济管理学院,四川,绵阳,621010
摘    要:高校实施学分制过程中,学生先选课再排课,排课方案搜索变得相当复杂.传统的排课算法常采用字符串比较的方式,因此排课效率较低.以二进制位为单元的算法和数据结构,用位的表示方式构建出数据表,既缩短了数据量又提高了运算速度.通过在MS-SQL上建立存储过程并编写用于实现学校排课的应用程序,能大大提高排课效率,同时也使数据的交换量仅为原来的1/8.通过在拥有两万多学生的高校进行排课实测,结果显示该算法简练、逻辑清晰、快速高效.

关 键 词:算法  学分制  选课  排课  位运算  数据结构
文章编号:1000-7024(2006)19-3709-04
收稿时间:2005-12-20
修稿时间:2005-12-20

Data structure and algorithm for course arranging based on credit system
LI Duan-ming,LI Yu-xiang.Data structure and algorithm for course arranging based on credit system[J].Computer Engineering and Design,2006,27(19):3709-3712.
Authors:LI Duan-ming  LI Yu-xiang
Affiliation:School of Economics and Management, Southwest University of Science and Technology, Mianyang 621010, China
Abstract:When colleges implement credit system, students need select courses first, and arrange courses then, which makes course arranging scheme search become fairly complex. Traditional course arranging algorithm frequently adopts the way of string comparison, it is lower efficiency. The algorithm and data structure with the bit of binary as unit, data sheet is formed with bit, it shorts the data bulk and raises operational speed. The application program is compiled that is used to realize course arranging, by establishing on MS-SQL to stock course, which can raise course arranging efficiency greatly, at the same time also make the exchange of data measure is only as 1/8 as original. Actual measurement is done in the college which has the students more than twenty thousands. The result shows that this algorithm is simplify, clear, and efficient.
Keywords:algorithm  credit system  course selecting  course arranging  bit operation  data structure
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号