摘要
大学生选课是一个既重要又繁琐的过程,如果不提前规划,就有可能出现错失特定学期的中意课程,单学期课业量过重和时间浪费问题,进而影响学习主动性和学业成绩。为解决上述问题,研发选课推荐系统,根据学生所设限定条件推荐多学期的选课方案。文章提出基于0-1背包的回溯算法来处理约束,可以大范围剪枝,加快求解速度。测试结果表明,本系统可以为学生推荐意向匹配率高且课业量少的选课方案。
Course selection for college students is an essential and trivial process.If students do not plan,they may face problems like missing the favorite courses in a specific semester,overloading a single semester or wasting time,which will affect their learning initiative and academic performance.A course selection recommendation system is developed to solve the above problems.The system can recommend multi-semester course selection plans according to the limiting conditions set by students.This paper proposes a backtracking algorithm based on the 0-1 knapsack to deal with constraints,pruning in an extensive range to speed up the solving.Test results show that the system can recommend plans with a high matching rate of intentions and a low academic load.
作者
龚熙
于洋
Gong Xi;Yu Yang(College of Computer and Information Engineering,Tianjin Normal University,Tianjin 300387,China)
出处
《计算机时代》
2021年第10期75-77,82,共4页
Computer Era
基金
天津师范大学校级教学改革项目(JGYB01218046)。
关键词
0-1背包
回溯算法
推荐系统
课程规划
选课
0-1 knapsack
backtracking algorithm
recommendation system
course planning
course selection
