Skip to main content
SpringerLink
Log in

Structure and Constraints in Interactive Exploratory Algorithm Learning

  • Conference paper
  • First Online:
Software Visualization

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2269))

Abstract

Traditionally an algorithm is taught by presenting and explaining the problem, the algorithm pseudocode and an algorithm animation or a sequence of static snapshots. My aim is to foster creativity, motivation and high level programming concepts by providing the student an alternative route to algorithm understanding: exploratory learning. The algorithm is structured into several functions and this structure is presented to the student. The student is encouraged to device a pseudocode description himself. An instance of the problem is presented on the level of each algorithm function. A graphical simulation of the data structures and some of the algorithm functions are provided. It is the student’s task to find out a correct sequence of function calls that will solve the problem instance. The instructor can control the difficulty of the task by providing algorithm constraints. Each new constraint will shrink the solution space and thus ease the task.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. John T. Stasko, John B. Domingue, Marc H. Brown und Blaine A. Price (Hrsg.): „Software Visualization”. 1998. MIT Press, Cambridge, Massachusetts.

    Google Scholar 

  2. Christopher Hundhausen, Sarah Douglas and John Stasko. (In press). A meta-study of algorithm visualization effectiveness. Journal of Visual Languages and Computing, to appear.

    Google Scholar 

  3. Christopher Hundhausen: „Toward Effective Algorithm Visualization Artifacts. Designing for Participation and Communication in an Undergraduate Algorithms Course”. Dissertation. June 1999. CIS-TR-99-07. Dept. of Comp. and. Inf. Science, University of Oregon, Eugene, USA. http://lilt.ics.hawaii.edu/~hundhaus/dis/.

  4. T. Hung and S. H. Rodger: „Increasing Visualization and Interaction in the Automata Theory Course”, Thirty-first SIGCSE Technical Symposium on Computer Science Education, p. 6–10, 2000.

    Google Scholar 

  5. Linda Stern, Harald Sondergaard and Lee Naish: „A Strategy for Managing Content Complexity in Algorithm Animation”. PP 127–130 in: Bill Manaris (Ed.), Proceedings of the 4th Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education — ITiCSE’ 99. June 1999. ACM Press, New York.

    Google Scholar 

  6. Amir Michail: „Teaching Binary Tree Algorithms though Visual Programming”. In Symposium on Visual Languages, pages 38–45, IEEE, September 1996. http://opsis.sourceforge. net/

  7. Bertrand Meyer: „Object-Oriented Software Construction”. 2nd ed. 1997. Prentice Hall.

    Google Scholar 

  8. John R. Anderson: „Kognitive Psychologie”. 2. ed.. 1996. Spektrum Akad. Verlag. Translated from „Cognitive Psychology and its Implications”. 4th ed.. 1995. Freeman.

    Google Scholar 

  9. Walter Edelmann: „Lernpsychologie”. 5. Auflage. 1996. Psychologie Verlags Union.

    Google Scholar 

  10. Seymour Papert: „Mindstorms. Children Computers and Powerful Ideas.”. 1980. Basic Books.

    Google Scholar 

  11. Steven R. Hansen, N. Hari Narayanan and Dan Schrimpsher. 2000. Helping learners visualize and comprehend algorithms. Interactive Multimedia Electronic Journal of Computer-Enhanced Learning, 1(1).http://imej.wfu.edu/articles/2000/1/02/index.asp

  12. John Stasko, Albert Badre and C. Lewis. Do Algorithm Animations Assist Learning? An Empirical Study and Analysis. 1993. In Proceedings of ACM INTERCHI’93 Conference on Human Factors in Computing Systems (pp. 61–66). New York: ACM Press.

    Google Scholar 

  13. Thomas H. Cormen, Charles E. Leiserson und Ronald L. Rivest: „Introduction to Algorithms”. 1990. MIT Press.

    Google Scholar 

  14. Robert Sedgewick: „Algorithms in C++”. 1992. Addison-Wesley.

    Google Scholar 

  15. Robert W. Floyd. Algorithm 245 (treesort). Communications of the ACM, 7:701, 1964.

    Google Scholar 

  16. Marc Brown: „Algorithm Animation”. 1987. MIT Press, Cambridge.

    Google Scholar 

  17. Nils Faltin: „Aktives Lernen von Algorithmen mit interaktiven Visualisierungen”. pp. 121–137 in: K. Mehlhorn and G. Snelting (Ed.): „Informatik 2000 — Jahrestagung der Gesellschaft für Informatik”. 2000. Springer.

    Google Scholar 

  18. Nils Faltin: „Learning Algorithms with Algorithm Simulations”. 2001. http://www-cg-hcie. informatik.uni-oldenburg.de/~faltin/SALA/int_vis_alg_e.html

  19. Nils Faltin: „Collection of Courseware for Computer Science (OLLI)”. 2001. http:// olli.informatik.uni-oldenburg.de.

Download references

Author information

Authors and Affiliations

  1. Abt. Computer Graphics & Software-Ergonomie, C. v. Ossietzky Universität Oldenburg, D - 26111, Oldenburg, Germany

    Nils Faltin

Authors
  1. Nils Faltin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FR Informatik, Saarland University, PO Box 15 11 50, 66041, Saarbrücken, Germany

    Stephan Diehl

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faltin, N. (2002). Structure and Constraints in Interactive Exploratory Algorithm Learning. In: Diehl, S. (eds) Software Visualization. Lecture Notes in Computer Science, vol 2269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45875-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45875-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43323-1

  • Online ISBN: 978-3-540-45875-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation