The problem of examination questions in algorithmics

Authors:
P. A. de Marneffe
Affiliations:
Service d'Informatique (Algorithmique), Institut Montefiore Université de Liège, B4000 Sart Tilman (Liège) Belgium
Venue:
ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
Year:
1998

Citing 2
Cited 1

Literate programming

The Computer Journal
A Discipline of Programming

A Discipline of Programming

JHAVÉ—an environment to actively engage students in Web-based algorithm visualizations

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algorithmics is a problem solving activity. Examination questions must reflect this nature of the domain. They must lead to open answers, but the specific criteria used in grading these answers must be clearly understood by the students. In this paper, we explain which criteria we use in the context of a course on algorithmics given to first year students in Informatics and in Engineering. Our experience shows that the teaching of very important topics in Computing Science can never be automated.