Integrated View at the MTCS Course Organization: The Case of Recursion - Guide to Teaching Computer Science: An Activity-Based Approach - page 233

Activity 105: Planning the Teaching of Recursion
Chapter 11 examines, among other topics, lesson planning. In the context
of recursion, an optional activity would ask students to prepare a lesson, for
example, about types of recursion (tail-recursion, double recursion, mutual
recursion) or about recursive manipulations of strings. Further discussion can
be conducted in relation to the order of integrating the learning of recursion
along a curriculum. This discussion can be based for example on the next
papers: (1) Bruce, Danyluk, and Murtagh ( 2005 ) explain Why they belive that
structural recursion should be taught before arrays in CS 1; and (2) Mirolo
( 2011 ) challenge the traditions and asks is iteration really easier to master
than recursion.
References
Bruce KB, Danyluk A, Murtagh T (2005) Why structural recursion should be taught before arrays
in CS 1. SIGCSE Bull 37(1):246-250
Eglash R, Krishnamoorthy M, Sanchez J, Woodbridge A (2011) Fractal simulations of African
design in pre-college computing education. ACM Transac Comput Educ (TOCE) 11(3):1-14
George CE (2000) ERSOI—Visualising recursion and discovering new errors. Proceedings of the
31st SIGCSE technical symposium on computer science education, Austin, Texas pp 305-309
Gersting JL (1996) Mathematical structures for computer science (3rd edition). WH Freeman,
New York
G￶tschi T, Sanders I, Galpin V (2003) Mental models of recursion. Proceedings of the 34th SIGC-
SE technical symposium on computer science education, Reno, Nevada
Harvey B (1997) Computer science logo style—volume 1: Symbolic computing 2/e. MIT Press,
Cambridge
Harvey B, Wright M (1999) Simply scheme: introducing computer science 2/e. MIT Press, Cam-
bridge
Hofstadter D (1979) Godel, Escher, Bach—an eternal golden braid. Vintage, New York
Lapidot T, Hazzan O (2005) Song debugging: merging content and pedagogy in computer science
education. Inroads—SIGCSE Bull 37(4):79-83
Lapidot T, Levy D, Paz T (2000) Functional programming for high school students. (in Hebrew).
Migvan—R & D in Computer Science Teaching, Technion, Haifa
Levy D (2001) Insights and conflicts in discussing recursion: a case study. Comp Sci Educ
11(4):305-322
Mirolo C (2011) Is iteration really easier to master than recursion: an investigation in a functional-
first CS1 context. In Proceedings of the 16th annual joint conference on Innovation and tech-
nology in computer science education (ITiCSE '11). ACM, New York, p 362
Pevac I (2012) First experiences with tutor for recursive algorithm time efficiency analysis. J
Comput Sci Coll 28(1):56-65
Settle A (2014) What's motivation got to do with it? A survey of recursion in the computing edu-
cation literature. Technical Reports. Paper 23. http://via.library.depaul.edu/tr/23. Accessed 1
June 2014
Shulman LS (1986) Those who understand: knowledge growth in teaching. J Educ Teach 15(2):4-14
Vickers P (1999) CAITLIN: Implementation of a musical program auralization system to study
the effects on debugging tasks as performed by novice Pascal programmers. Doctoral the-
sis, Loughborough University, UK. http://computing.unn.ac.uk/staff/cgpv1/caitlin/index.htm.
Accessed 22 Sept 2010