首页> 外文会议>Annual Conference on Frontiers in Education >Analysis of Algorithms: Programming To Problem Solving
【24h】

Analysis of Algorithms: Programming To Problem Solving

机译:算法分析:解决问题解决方案

获取原文

摘要

In Introduction to Analysis of Algorithms students' traditionally apply a combination of computer science theory and mathematics to paper-based problem solving, analysis of pre-developed algorithms and proofs of algorithmic run-times. In this paper, we suggest that that a major factor that determines success in Analysis is the discrepancy between the programming styles of CS1 and CS2, with immediate feedback of student solutions, a dynamic working environment and non-sequential implementation, and the learning requirements of a theory-based course, with delayed feedback of student solutions, a static working environment and sequential problem solving. Since they are not (as yet) supported by empirical evidence, these discussions do not lead to definitive claims about analysis and student performance; on the other hand, they do generate theories for research that could enhance the undergraduate experience in theory based courses.
机译:在算法分析中,学生传统上将计算机科学理论和数学的组合应用于基于纸张的问题解决,分析了前发达的算法和算法运行次数的证明。在本文中,我们建议确定分析成功的主要因素是CS1和CS2的编程风格之间的差异,具有直接反馈学生解决方案,动态工作环境和非顺序实施以及学习要求以及学习要求基于理论的课程,具有学生解决方案的延迟反馈,静态工作环境和顺序问题解决。由于它们不是(尚于)经验证据支持的,因此这些讨论不会导致对分析和学生表现的明确索赔;另一方面,它们确实为研究的理论产生了可提高理论基于理论课程的本科经验。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号