Teaching Planning - Guide to Teaching Computer Science: An Activity-Based Approach - page 212

5. Written reflection on the entire development process.
It is recommended to summarize this activity in one or two lessons of the
MTCS course, in which each student presents his or her work for 20-30 min.
The presentations can include two parts: (1) a summary of the individual
work and (2) introduction of a short excerpt from the planned lessons, which
can be taught by each student to his or her peers, together with a description of
the considerations that guided the development of this segment of the lesson.
It is also suggested that the course instructor encourages the students to reflect
on the process they went throughout the fulfillment of this activity.
References
Abhiram (2009) History of sorting algorithms. Blog spot. http://abhiramn.blogspot.com/2009/07/
history-of-sorting-algorithms.html. Accessed 10 May 2010
Bruce KB, Danyluk A, Murtagh T (2005) Why structural recursion should be taught before arrays
in CS 1. ACM SIGCSE Bull 37(1):246-250
Eagle M, Barnes T (2008) Wu's castle: teaching arrays and loops in a game. ACM SIGCSE Bull
40(3):245-249
Ginat D (1996) Efficiency of algorithms for programming beginners. SIGCSE Bull 28(1):256-260
Hilton M, Janzen DS (2012). On teaching arrays with test-driven learning in WebIDE. In: Proceed-
ings of the 17th ACM annual conference on Innovation and technology in computer science
education (ITiCSE '12). ACM, New York, NY, USA, 93-98
Howland JE (2005) Array algorithms. J Comput Small Coll 20(4):229-235
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, NY, USA, 362-362
Nieminen J (2006) Bubble sort as the first sorting algorithm. http://warp.povusers.org/grrr/bubble-
sort_eng.html. Accessed 15 May 2010
Nieminen J (2008) Bubble sort misconceptions. http://warp.povusers.org/grrr/bubblesort_miscon-
ceptions.Html. Accessed 15 May 2010
Ragonis N, Hazzan O (2008) Disciplinary-pedagogical teacher preparation for pre-service com-
puter science teachers: rationale and implementation. In: Mittermeir RT, Syslo MM (eds) Infor-
mation education—supporting computational thinking, lecture notes computer science 5090,
ISSEP 2008. Springer, Berlin, pp 253-264
Ventura P, Egert C, Decker A (2004) Ancestor worship in CS1: on the primacy of arrays. 19th Ann.
ACM SIGPLAN OOPSLA Conf.: 8-72