基于话语规则的自适应帕森斯问题

Proceedings of the eleventh annual International Conference on International Computing Education Research Pub Date : 2015-08-09 DOI:10.1145/2787622.2787740

Barbara Ericson

{"title":"基于话语规则的自适应帕森斯问题","authors":"Barbara Ericson","doi":"10.1145/2787622.2787740","DOIUrl":null,"url":null,"abstract":"Parsons problems are code segments that must be placed in the correct order with the correct indention. Research on Parsons problems suggests that they might be a more effective and efficient learning approach than writing equivalent code, especially for time-strapped secondary teachers. I intend to explore this hypothesis with empirical experiments, observations, and log file analysis.","PeriodicalId":394643,"journal":{"name":"Proceedings of the eleventh annual International Conference on International Computing Education Research","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Adaptive Parsons Problems with Discourse Rules\",\"authors\":\"Barbara Ericson\",\"doi\":\"10.1145/2787622.2787740\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parsons problems are code segments that must be placed in the correct order with the correct indention. Research on Parsons problems suggests that they might be a more effective and efficient learning approach than writing equivalent code, especially for time-strapped secondary teachers. I intend to explore this hypothesis with empirical experiments, observations, and log file analysis.\",\"PeriodicalId\":394643,\"journal\":{\"name\":\"Proceedings of the eleventh annual International Conference on International Computing Education Research\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the eleventh annual International Conference on International Computing Education Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2787622.2787740\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the eleventh annual International Conference on International Computing Education Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2787622.2787740","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

帕森斯问题是必须以正确的缩进顺序排列的代码段。对帕森斯问题的研究表明，它们可能是比编写等效代码更有效和高效的学习方法，特别是对于时间紧张的中学教师。我打算通过实证实验、观察和日志文件分析来探索这一假设。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Adaptive Parsons Problems with Discourse Rules

Parsons problems are code segments that must be placed in the correct order with the correct indention. Research on Parsons problems suggests that they might be a more effective and efficient learning approach than writing equivalent code, especially for time-strapped secondary teachers. I intend to explore this hypothesis with empirical experiments, observations, and log file analysis.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the eleventh annual International Conference on International Computing Education Research

自引率

0.00%

发文量