Abstract
Teaching planning is one of the main pedagogical activities teachers perform. 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. 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 Methods of Teaching Computer Science (MTCS) course for this purpose. The principles of teaching planning presented in this chapter can serve any computer science educator in any teaching framework.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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: Proceedings 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 technology 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/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 RT, Syslo MM (eds) Information 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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London Limited
About this chapter
Cite this chapter
Hazzan, O., Lapidot, T., Ragonis, N. (2014). Teaching Planning. In: Guide to Teaching Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-6630-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6630-6_11
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6629-0
Online ISBN: 978-1-4471-6630-6
eBook Packages: Computer ScienceComputer Science (R0)