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


Reinforcing key combinatorial ideas in a computational setting: A case of encoding outcomes in computer programming
Affiliation:1. Oregon State University, 064 Kidder Hall, Department of Mathematics Corvallis, OR, 97331, United States;2. University of Oslo, Centre for Computing in Science Education (CCSE), Sem Saelands vei 24, Fysikkbygningen, Oslo, 0371, Norway;3. Oregon State University, 320 Kidder Hall, Department of Mathematics Corvallis, OR, 97331, United States
Abstract:Counting problems are difficult for students to solve, and there is a perennial need to investigate ways to help students solve counting problems successfully. One promising avenue for students’ successful counting is for them to think judiciously about how they encode outcomes – that is, how they symbolize and represent the outcomes they are trying to count. We provide a detailed case study of two students as they encoded outcomes in their work on several related counting problems within a computational setting. We highlight the role that a computational environment may have played in this encoding activity. We illustrate ways in which by-hand work and computer programming worked together to facilitate the students’ successful encoding activity. This case demonstrates ways in which the activity of computation seemed to interact with by-hand work to facilitate sophisticated encoding of outcomes.
Keywords:Combinatorics  Encoding outcomes  Computation  Programming  Discrete mathematics
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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