Title

The Learning of Plans in Programming: A Program Completion Approach.

Document Type

Conference Proceeding

Publisher

IEEE

Faculty

Business and Public Management

School

Business

RAS ID

844

Comments

This article was originally published as: Garner, S. K. (2002). The learning of plans in programming: a program completion approach. Proceedings of International Conference on Computers in Education, 2003. Auckland, New Zealand. IEEE. Original article available here

Abstract

Programming plans are stereotyped sequences of computer instructions, that form a hierarchy of generalised programming knowledge. They can be thought of as the building blocks of computer programs. In the learning of programming, it is necessary for students to build knowledge of a variety of plans that they can then make use of during the development of larger programs. This paper discusses two methods by which students can learn such plans, the "conventional" method that has been used by instructors for many years, and the "completion" method. The completion method requires students to complete part-complete solutions to given programming problems. As part of a research project, some students were observed using the completion method in conjunction with a software tool, CORT (code restructuring tool). The paper reports on one particular observation in which a student was required to build a programming plan. It concludes that the student gained a deep understanding of how the plan worked during the knowledge construction process.

DOI

10.1109/CIE.2002.1186149

 

Link to publisher version (DOI)

10.1109/CIE.2002.1186149