摘要
介绍算法分析与设计课程中最长公共子序列问题的动态规划算法,利用该算法解决最长递减子序列问题和回文词的构造问题,通过这两个问题的求解,有助于学生举一反三,启发学生思维,以学致用,提高问题求解能力。
This paper introduces a dynamic programming algorithm of the longest common subsequence problem in the course of analysis and design of algorithm, by use of which this paper solves the longest descending subsequence problem and the construction of the palindromic sequence problem. By solving the two problems, will help students draw inferences about other cases from one instance, inspire students’ thinking, apply their knowledge to all, improve the ability of problem solving.
出处
《中国教育技术装备》
2014年第24期109-111,共3页
China Educational Technology & Equipment
基金
2014年黑龙江省高等教育教学改革项目"工程能力为目标的程序设计课程体系研究"(项目编号:JG2014010997)
2013年黑龙江省教育科学十二五规划课题"<网络安全>课程网络攻防实践教学平台开发"(项目编号:GBD1213039)
2014年黑龙江科技大学教学研究项目"基于学科竞赛活动的算法分析与设计课程教学改革探索"(项目编号:JY14-98)的研究成果
关键词
最长公共子序列
动态规划
递减子序列
回文词
longest common subsequence
dynamic programming
descending subsequence
palindromic sequence
