Advertisement

Teaching Problem Solving and Computer Science in the Schools

Chapter
  • 442 Downloads

Abstract

Computer Science Education (CSEd) is a young field that is comprised of numerous established disciplines, such as science, mathematics, education, and psychology. Fincher and Petre (2004) in their seminal text on CSEd suggested that moving the discipline toward independence would require that researchers ask questions that may only be answered through computer science. Because of CSEd’s relative youth, it is common for researchers in this problem space to look to other disciplines for theory to help answer research questions.

Keywords

Computer Science British Columbia Middle School Student Lesson Study Theoretical Computer Science 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. Anthony, R. J., Yore, L. D., Coll, R. K., Dillon, J., Chiu, M.-H., Fakudze, C., et al. (2009). Research ethics boards and gold standard(s) in literacy and science education research. In M. C. Shelley II, L. D. Yore, & B. Hand (Eds.), Quality research in literacy and science education: International perspectives and gold standards (pp. 511–557). Dordrecht, The Netherlands: Springer.Google Scholar
  2. Bell, T., Witten, I. H., Fellows, M., Adams, R., & McKenzie, J. (2006). Computer science unplugged. An enrichment and extension programme for primary-aged children (teacher ed.). Retrieved from http://www.csunplugged.org/
  3. Briggs, J. (1992). Fractals: The patterns of chaos. New York: Touchstone.Google Scholar
  4. Carruthers, S. (2010a). Grasping graphs. Master’s thesis, University of Victoria. Retrieved from http://www.hdl.handle.net/1828/3193
  5. Carruthers, S. (2010b). An interdisciplinary guide for K–8 computer science (CS) education [Poster]. Presented at the 41st ACM Technical Symposium on Computer Science Education (SIGCSE’10), Milwaukee, WI, USA.Google Scholar
  6. Carruthers, S. (2010c). Relational graphs: What are they? [DVD]. Presented at the 41st ACM Technical Symposium on Computer Science Education (SIGCSE’10), Milwaukee, WI, USA.Google Scholar
  7. Carruthers, S., Milford, T. M., Pelton, T. W., & Stege, U. (2010). Moving K–7 computer science instruction into the information age. In Proceedings of the 15th Western Canadian Conference for Computing Education (WCCCE’10) (pp. 1–5).Google Scholar
  8. Carter, L. (2006). Why students with an apparent aptitude for computer science don’t choose to major in computer science. In Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education (SIGCSE’06) (pp. 27–31).Google Scholar
  9. Cohen, J. (1990). Things I have learned (so far). American Psychologist, 45(12), 1304–1321.CrossRefGoogle Scholar
  10. Dijkstra, E. W. (n.d.). Retrieved from Wikipedia, the Free Encyclopedia: http://www.en.wikipedia.org/wiki/Edsger_W._Dijkstra
  11. Elliot, A. C., & Woodward, W. A. (2007). Statistical analysis quick reference guide with SPSS examples. Thousand Oaks, CA: Sage.Google Scholar
  12. Fincher, S., & Petre, M. (2004). Computer science education research. London, England: Routledge Falmer.Google Scholar
  13. Flakener, N., Sooriamurthi, R., & Michalewicz, Z. (2010). Puzzle based learning for engineering and computer science. IEEE Computer Society, 43(4), 20–28.Google Scholar
  14. Ford, G. (1982). A framework for teaching recursion. SIGCSE Bulletin, 14(2), 32–39.CrossRefGoogle Scholar
  15. Goode, J. (2008). Increasing diversity in K–12 computer science: Strategies from the field. In Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education (SIGCSE’08) (pp. 362–366).Google Scholar
  16. Goodrich, M. T., & Tamassia, R. (2002). Algorithm design: Foundations, analysis and internet examples. New York: Wiley.Google Scholar
  17. Grimaldi, R. P. (1998). Discrete mathematics (4th ed.). Reading, MA: Addison-Wesley.Google Scholar
  18. Gunion, K. (2009). FUNdamentals of CS: Designing and evaluating computer science activities for kids. Master’s thesis, University of Victoria. Retrieved from http://www.hdl.handle.net/1828/2750
  19. Gunion, K., Milford, T. M., & Stege, U. (2009a). Curing recursion aversion. In Proceedings of the 14th ACM SIGCSE Conference on Innovation and Technology in Computer Science Education (ItiCSE’09) (pp. 124–128).Google Scholar
  20. Gunion, K., Milford, T. M., & Stege, U. (2009b). The paradigm recursion. Journal of Problem Solving, 2(2), 142–172.Google Scholar
  21. Haberman, B., & Averbuch, H. (2002). The case of base cases: Why are they so difficult to recognize? Student difficulties with recursion. SIGCSE Bulletin, 34(3), 84–88.CrossRefGoogle Scholar
  22. Hsin, W. (2008). Teaching recursion using recursion graphs. Journal of Computing Sciences in Colleges, 23(4), 217–222.Google Scholar
  23. Katz, J. S., & Martin, B. R. (1997). What is research collaboration? Research Policy, 26(1), 1–18.CrossRefGoogle Scholar
  24. Klein, A. (2006). K–12 education shrinking future college graduate population in computer studies. Journal of Computing Sciences in Colleges, 21(4), 32–34.Google Scholar
  25. MicroWorlds EX [Computer software]. (2010). Retrieved from http://www.microworlds.com/solutions/mwex.html
  26. Niman, J. (1975). Graph theory in the elementary school. Educational Studies in Mathematics, 6(2), 351–373.CrossRefGoogle Scholar
  27. Ormond, J. E., Saklofske, D. H., Schwean, V. L., Harrison, G. L., & Andrews, J. J. W. (2006). Principles of educational psychology (2nd Canadian ed.). Toronto, ON, Canada: Pearson Education.Google Scholar
  28. Randolph, J., Julnes, G., Sulinen, E., & Lehman S. (2008). A methodological review of computer science education research. Journal of Information Technology Education, 7(1), 135–162.Google Scholar
  29. Romanow, H., Stege, U., Agah St Pierre, A., & Ross, L. (2008). Increasing accessibility: Teaching children important computer science concepts without sacrificing conventional subjects of study. Presented at the 13th Western Canadian Conference on Computing Education (WCCCE’08). Retrieved from http://www.outreach.cs.uvic.ca/2008WCCCE.pdf
  30. Schunk, D. H. (2000). Learning theories: An educational perspective (3rd ed.). Upper Saddle River, NJ: Merrill.Google Scholar
  31. Service Canada. (2011). Computer programmers and interactive media developers. Retrieved from http://www.servicecanada.gc.ca/eng/qc/job_futures/statistics/2174.shtml
  32. Slonim, J., Scully, S., & McAllister, M. (2008). Crossroads for Canadian CS enrollment: What should be done to reverse falling CS enrollment in the Canadian education system? Communications of the ACM, 51(10), 66–70.CrossRefGoogle Scholar
  33. Tooley, J., & Darby, D. (1998). Educational research - A critique. London, England: Office for Standards in Education. Retrieved from http://www.ofsted.gov.uk/Ofsted-home/Publications-and-research/Browse-all-by/Education/Leadership/Governance/Educational-research-a-critique-the-Tooley-report
  34. United States Computer Science Teachers Association. (2006). A model curriculum for K–12 computer science: Final report of the ACM task force curriculum committee (2nd ed.). New York: Author.Google Scholar
  35. Zweben, S. (2008). Computing degree and enrolment trends from the 2007–2008 CRA Taulbee Survey: Undergraduate enrolment in computer science trends higher; doctoral production continues at peak levels. Washington, DC: Computing Research Association. Retrieved from http://www.archive.cra.org/taulbee/CRATaulbeeReport-StudentEnrollment-07-08.pdf

Copyright information

© Sense Publishers 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada
  2. 2.Department of Computer ScienceUniversity of VictoriaVictoriaCanada
  3. 3.Department of Educational PsychologyUniversity of VictoriaVictoriaCanada

Personalised recommendations