ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Synthesis and analysis of automatic assessment methods in CS1: generating intelligent MCQs
Full text PdfPdf (136 KB)
Source Technical Symposium on Computer Science Education archive
Proceedings of the 36th SIGCSE technical symposium on Computer science education table of contents
St. Louis, Missouri, USA
SESSION: Assessing student learning table of contents
Pages: 495 - 499  
Year of Publication: 2005
ISBN:1-58113-997-7
Also published in ...
Authors
Des Traynor  National University of Ireland, Maynooth Co. Kildare, Ireland
J. Paul Gibson  National University of Ireland, Maynooth Co. Kildare, Ireland
Sponsors
SIGCSE: ACM Special Interest Group on Computer Science Education
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 60,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1047344.1047502
What is a DOI?

ABSTRACT

This paper describes the use of random code generation and mutation as a method for synthesising multiple choice questions which can be used in automated assessment. Whilst using multiple choice questions has proved to be a feasible method of testing if students have suitable knowledge or comprehension of a programming concept, creating suitable multiple choice questions that accurately test the students' knowledge is time intensive.This paper proposes two methods of generating code which can then be used to closely examine the comprehension ability of students. The first method takes as input a suite of template programs, and performs slight mutations on each program and ask students to comprehend the new program. The second method performs traversals on a syntax tree of possible programs, yielding slightly erratic but compilable code, again with behaviour that students can be questioned about. As well as generating code these methods also yield alternative distracting answers to challenge the students. Finally, this paper discusses the gradual introduction of these automatically generated questions as an assessment method and discusses the relative merits of each technique.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. F. Biehler and J. Snowman. Psychology Applied to Teaching. Houghton Mifflin Company, 8th edition, 1997.
 
2
B. S. Bloom and D. R. Krathowl. Taxonomy of educational objectives. McKay & Co, 1956.
3
 
4
B. duBoulay. Some difficulties of learning to program. In E. Soloway and J. C. Spohrer, editors, Studying the Novice Programmer, chapter 15, pages 283--301. Lawrence Erlbaum Associates, 1989.
5
6
7
8
9
10
11
 
12
R. Putnam, D. Sleeman, J. Baxter and, and L. Kuspa. A summary of misconceptions of high school BASIC programmers. Journal of Educational Computing Research, 2:459--472, 1986.
 
13
 
14
15
 
16
R. C. Sprinthall, N. A. Sprinthall, and S. N. Oja. Educational Psycholgy. McGraw-Hill Education, 7th edition, 1998.


Collaborative Colleagues:
Des Traynor: colleagues
J. Paul Gibson: colleagues