Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

Using Counter-Examples in the Data Structures Course

Fekete, A.

    In many computer science courses, students face a sequence of activities that is quite monotonous in style: most assignments and labs ask the student to write a program that does something, to follow a procedure or else to prove something. We advocate varying the pattern by including different types of activity which bring students to reflect on their ideas and especially to confront directly common misconceptions. We use the traditional 'data structures' subject as the domain in which to present this approach to teaching. We give detailed accounts of several activities that include debugging wrong code and explaining the misconception in an argument.
Cite as: Fekete, A. (2003). Using Counter-Examples in the Data Structures Course. In Proc. Fifth Australasian Computing Education Conference (ACE2003), Adelaide, Australia. CRPIT, 20. Greening, T. and Lister, R., Eds. ACS. 179-186.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007