This chapter deals with teaching planning, which is one of the main pedagogical activities teachers perform. In fact, all the tools, ideas, and perspectives presented in the Guide can be used and applied in the process of teaching planning, which is, to some extent, independent of the taught discipline. Specifically, in this chapter, we offer and demonstrate a top-down approach for teaching planning which takes into account a wide range of considerations, and present several activities to be facilitated in the MTCS course. The principles of teaching planning presented in this chapter, however, can serve any computer science educator in any teaching framework.
KeywordsLesson Plan Teaching Planning Study Unit Array Cell Computer Science Education
- Abhiram (2009) History of sorting algorithms. Blog spot. http://abhiramn.blogspot.com/2009/07/history-of-sorting-algorithms.html. Accessed 10 May 2010
- Howland J E (2005) Array algorithms. J. Comput. in Small Coll. 20(4): 229–235Google Scholar
- Nieminen J (2006) Bubble sort as the first sorting algorithm. http://warp.povusers.org/grrr/bubblesort_eng.html. Accessed 15 May 2010
- Nieminen J (2008) Bubble sort misconceptions. http://warp.povusers.org/grrr/bubblesort_misconceptions.Html. Accessed 15 May 2010
- Ragonis N, Hazzan O (2008) Disciplinary-pedagogical teacher preparation for pre-service computer science teachers: Rationale and implementation. In Mittermeir R T, Syslo MM (Eds.) Inf. Educ.- Supporting Comput. Thinking, Lect. Notes Comput. Sci. 5090, ISSEP 2008, Germany, Berlin/Heidelberg: Springer: 253–264CrossRefGoogle Scholar
- Ventura P, Egert C, Decker A (2004) Ancestor worship in CS1: On the primacy of arrays. 19th Ann. ACM SIGPLAN OOPSLA Conf.: 8–72Google Scholar