Annual Conference on Innovation and Technology in Computer Science Education最新文献_第8页

Mining job ads to find what skills are sought after from an employers' perspective on IT graduates 挖掘招聘广告，从雇主的角度寻找IT毕业生所需要的技能

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2602670

Morgan Ericsson, Anna Wingkvist

引用次数: 3

Do student programmers all tend to write the same software tests? 学生程序员是否都倾向于编写相同的软件测试?

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591757

S. Edwards, Z. Shams

{"title":"Do student programmers all tend to write the same software tests?","authors":"S. Edwards, Z. Shams","doi":"10.1145/2591708.2591757","DOIUrl":"https://doi.org/10.1145/2591708.2591757","url":null,"abstract":"While many educators have added software testing practices to their programming assignments, assessing the effectiveness of student-written tests using statement coverage or branch coverage has limitations. While researchers have begun investigating alternative approaches to assessing student-written tests, this paper reports on an investigation of the quality of student written tests in terms of the number of authentic, human-written defects those tests can detect. An experiment was conducted using 101 programs written for a CS2 data structures assignment where students implemented a queue two ways, using both an array-based and a link-based representation. Students were required to write their own software tests and graded in part on the branch coverage they achieved. Using techniques from prior work, we were able to approximate the number of bugs present in the collection of student solutions, and identify which of these were detected by each student-written test suite. The results indicate that, while students achieved an average branch coverage of 95.4% on their own solutions, their test suites were only able to detect an average of 13.6% of the faults present in the entire program population. Further, there was a high degree of similarity among 90% of the student test suites. Analysis of the suites suggest that students were following naïve, \"happy path\" testing, writing basic test cases covering mainstream expected behavior rather than writing tests designed to detect hidden bugs. These results suggest that educators should strive to reinforce test design techniques intended to find bugs, rather than simply confirming that features work as expected.","PeriodicalId":334476,"journal":{"name":"Annual Conference on Innovation and Technology in Computer Science Education","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129624067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 40

A social platform supporting learning through video creation by students 一个支持学生通过视频创作学习的社交平台

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2602685

J. Urquiza-Fuentes, Jorge Castellanos, Isidoro Hernán-Losada, Estefanía Martín, P. Haya

引用次数: 0

Algorithmic thinking for ALL: a motivational perspective 所有人的算法思维:动机视角

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2602669

Z. Kátai

引用次数: 2

A method to prove query lower bounds 一个证明查询下界的方法

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591736

J. M., Sridhar S. Iyer

{"title":"A method to prove query lower bounds","authors":"J. M., Sridhar S. Iyer","doi":"10.1145/2591708.2591736","DOIUrl":"https://doi.org/10.1145/2591708.2591736","url":null,"abstract":"The query-model or decision-tree model is a computational model in which the algorithm has to solve a given problem by making a sequence of queries which have 'Yes' or 'No' answers. A large class of algorithms can be described on this model and we can also prove non-trivial lower bounds for many problems on this model.\u0000 Many lower bounds on the query-model are proved using a technique called adversary argument. In CS courses, a common example used to illustrate the adversary argument is the following problem: Suppose there is an unweighted graph G with $n$ vertices represented by an adjacency matrix. We want to test if the graph is connected. How many entries in the adjacency matrix do we have to probe in order to test if the graph has this property (property being 'connectivity')? Each probe is considered as a query.\u0000 Since the adjacency matrix has only n^2 entries, O(n^2) queries are sufficient. It is also known that Omega(n^2) queries are necessary. Proving this lower bound is more difficult and is done using the adversary argument.\u0000 In literature, we find that lower bound proofs of this problem rely too much on 'connectivity' property and do not generalize well. When the property being tested is changed, the proof changes significantly. Our contribution is a method that gives a systematic way of proving lower bounds for problems involving testing of many graph-properties. We did a pilot experiment and found that students were able to understand and apply our method.","PeriodicalId":334476,"journal":{"name":"Annual Conference on Innovation and Technology in Computer Science Education","volume":"36 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131317236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Three views on motivation and programming 关于动机和规划的三种观点

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591709

Amber Settle, Arto Vihavainen, Juha Sorva

引用次数: 15

Enhancing syntax error messages appears ineffectual 增强语法错误消息似乎无效

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591748

Paul Denny, Andrew Luxton-Reilly, Dave Carpenter

引用次数: 109

Peer instruction: a link to the exam 同侪指导:考试链接

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591711

Daniel Zingaro, Leo Porter

引用次数: 17

A qualitative think-aloud study of novice programmers' code writing strategies 对新手程序员代码编写策略的定性有声思考研究

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591762

Jacqueline L. Whalley, Nadia Kasto

引用次数: 44

Failure rates in introductory programming revisited 重新审视了介绍性编程的失败率

Annual Conference on Innovation and Technology in Computer Science Education Pub Date : 2014-06-21 DOI: 10.1145/2591708.2591749

Christopher Watson, Frederick W. B. Li

{"title":"Failure rates in introductory programming revisited","authors":"Christopher Watson, Frederick W. B. Li","doi":"10.1145/2591708.2591749","DOIUrl":"https://doi.org/10.1145/2591708.2591749","url":null,"abstract":"Whilst working on an upcoming meta-analysis that synthesized fifty years of research on predictors of programming performance, we made an interesting discovery. Despite several studies citing a motivation for research as the high failure rates of introductory programming courses, to date, the majority of available evidence on this phenomenon is at best anecdotal in nature, and only a single study by Bennedsen and Caspersen has attempted to determine a worldwide pass rate of introductory programming courses.\u0000 In this paper, we answer the call for further substantial evidence on the CS1 failure rate phenomenon, by performing a systematic review of introductory programming literature, and a statistical analysis on pass rate data extracted from relevant articles. Pass rates describing the outcomes of 161 CS1 courses that ran in 15 different countries, across 51 institutions were extracted and analysed. An almost identical mean worldwide pass rate of 67.7% was found. Moderator analysis revealed significant, but perhaps not substantial differences in pass rates based upon: grade level, country, and class size. However, pass rates were found not to have significantly differed over time, or based upon the programming language taught in the course. This paper serves as a motivation for researchers of introductory programming education, and provides much needed quantitative evidence on the potential difficulties and failure rates of this course.","PeriodicalId":334476,"journal":{"name":"Annual Conference on Innovation and Technology in Computer Science Education","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 486