Commonsense computing (episode 3): concurrency and concert tickets
Commonsense computing (episode 3): concurrency and concert tickets
复制标题
常识计算（第3集）：并发和音乐会门票
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
B. Simon
中科院分区：
文献类型：
--
作者：
G. Lewandowski;D. Bouvier;R. McCartney;Kate Sanders;B. Simon
作为调查常识计算的系列项目中的第三个项目-学生在任何正式的计算学习之前都拥有的相关知识-我们检查了学生对并发的常识理解。具体来说，我们复制了（经过修改）本-大卫·科利坎特的一个实验。[2]Ben-David Kolikant的数据是从以前学习过计算的高中毕业生那里收集的，当时他们正在学习并发和分布式编程的高级课程。我们修改了她的一个问题，以反映我们的学生缺乏背景，在CS 1的第一周，我们要求五个不同机构的学生用英语描述当不止一个人出售音乐会门票时可能出现的问题。
几乎所有的学生（97%）都发现了感兴趣的问题--卖家之间可能会出现竞争条件。73%的学生至少找到了一种可能的解决方案。我们发现，Ben-David Kolikant开发的分类在应用于我们的数据时也是有意义的，我们的初级CS 1学生比Ben-David Kolikant的并发学生更有可能给出集中式解决方案（而不是分散式解决方案），并且解决方案的粒度在经验丰富的学生中更精细。
As the third in a series of projects investigating commonsense computing -- the relevant knowledge that students have before any formal study of computing -- we examine students' commonsense understanding of concurrency. Specifically, we replicated (with modifications) an experiment by Ben-David Kolikant. [2] Ben-David Kolikant's data were gathered from high-school seniors who had previously studied computing, at the beginning of an advanced class in concurrent and distributed programming. Modifying one of her questions to reflect our students' lack of background, we asked students at five different institutions, in the first week of CS1, to describe in English the problems that might arise when more than one person is selling seats to a concert.
Almost all students (97%) identified the problem of interest -- that a race condition may occur between sellers. 73% of students identified at least one possible solution. We found that the categorizations developed by Ben-David Kolikant were also meaningful when applied to our data, that our beginning CS1 students are more likely to give centralized solutions (as opposed to decentralized ones) than Ben-David Kolikant's concurrency students, and that the granularity of solutions is finer among the more experienced students.