首页> 外文会议>International Seminar on Software Visualization, May 20-25, 2001, Dagstuhl Castle, Germany >Structure and Constraints in Interactive Exploratory Algorithm Learning
【24h】

Structure and Constraints in Interactive Exploratory Algorithm Learning

机译:交互式探索性算法学习中的结构和约束

获取原文
获取原文并翻译 | 示例

摘要

Traditionally an algorithm is taught by presenting and explaining the problem, the algorithm pseudocode and an algorithm animation or a sequence of static snapshots. My aim is to foster creativity, motivation and high level programming concepts by providing the student an alternative route to algorithm understanding: exploratory learning. The algorithm is structured into several functions and this structure is presented to the student. The student is encouraged to device a pseudocode description himself. An instance of the problem is presented on the level of each algorithm function. A graphical simulation of the data structures and some of the algorithm functions are provided. It is the student's task to find out a correct sequence of function calls that will solve the problem instance. The instructor can control the difficulty of the task by providing algorithm constraints. Each new constraint will shrink the solution space and thus ease the task.
机译:传统上,算法是通过介绍和解释问题,算法伪代码和算法动画或静态快照序列来教授的。我的目标是通过向学生提供另一种理解算法的途径:探索性学习,来培养创造力,动力和高级编程概念。该算法分为几个功能,并向学生介绍了此结构。鼓励学生自己使用伪代码描述。在每个算法功能的级别上提供了一个问题实例。提供了数据结构的图形仿真和一些算法功能。找到正确的函数调用序列以解决问题实例是学生的任务。讲师可以通过提供算法约束来控制任务的难度。每个新约束都会缩小解决方案空间,从而简化任务。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号