You are here:

Linking Tilings to Algorithms: An Approach for Introducing Programming Concepts PROCEEDINGS

, Wesleyan College, United States

EdMedia + Innovate Learning, in Vancouver, Canada ISBN 978-1-880094-62-4 Publisher: Association for the Advancement of Computing in Education (AACE), Waynesville, NC

Abstract

This poster presents an approach of linking patterns in tilings to regularities in algorithms to help motivate and connect learners with programming concepts. The tiling patterns are used as spatial embodiments of temporal processes. The act of creating the tilings evolves over the duration of the class (CS1): it begins as purely an imperative task, then it moves to partially imperative and partially planned tasks, and finally to completely preplanned tasks. The midpoint between imperative and planned is achieved by allowing for the history of actions to be editable and acted upon with cut and pastes. The progression is accomplished by using of two prototype environments: TileLand (Sedig et. al. 2002). for the imperative and partial planned tasks and PolygonR&D (Morey 2006) for the completely preplanned task. This approach was used in two first year computer science courses have, it appears to be good way to initiate non-computer science majors into the world of programming.

Citation

Morey, J. (2007). Linking Tilings to Algorithms: An Approach for Introducing Programming Concepts. In C. Montgomerie & J. Seale (Eds.), Proceedings of ED-MEDIA 2007--World Conference on Educational Multimedia, Hypermedia & Telecommunications (pp. 2947-2950). Vancouver, Canada: Association for the Advancement of Computing in Education (AACE). Retrieved September 22, 2018 from .

Keywords

View References & Citations Map

References

  1. Dann, W., Cooper, S., and Pausch, R. (2001). Using visualization to teach novices recursion. ACM SIGCSE Bulletin 33, 3, 109-112.
  2. Morey, J. (2006). Programming in PolygonR & D: Explorations with a Spatial Language. International Journal of Computers for Mathematical Learning, Springer-Verlag. Volume 11, Number 2 / October, 147175
  3. Pioro, B.T. (2006). Introductory computer programming: gender, major, discrete mathematics, and calculus. Journal of Computing Sciences in Colleges, 21, 5 (May. 2006), 123-129.
  4. Rodger, S.H. (2002). Introducing computer science through animation and virtual worlds. In Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education (Cincinnati, Kentucky, February 27-March 03, 2002). SIGCSE '02. ACM Press, New York, NY, 186-190.
  5. Sedig, K, Morey, J, Chu, B (2002). TileLand: A Microworld for Creating Mathematical Art. Proceedings of ED-MEDIA 2002: World Conference on Educational Multimedia and Hypermedia, Denver, USA, Vol. 2002, Issue 1, 1778-1783.
  6. Turbak, F, Royden, C, Stephan, J, Herbst, J (1999) Teaching recursion before loops in CS1. Journal of Computing in Small Colleges, 14, 4, 86-101

These references have been extracted automatically and may have some errors. If you see a mistake in the references above, please contact info@learntechlib.org.

View References & Citations Map

Cited By

  1. Piecing Together Programs: Navigating Between Low-Level Instructions, Subroutines, and Programs

    Jim Morey, theAmatour, Canada

    EdMedia + Innovate Learning 2010 (Jun 29, 2010) pp. 3423–3428

These links are based on references which have been extracted automatically and may have some errors. If you see a mistake, please contact info@learntechlib.org.

Also Read

Related Collections