Abstract
In this chapter, the implementation of two courses on data structures and algorithms at the Helsinki University of Technology is presented. The courses are based on the constructivist learning paradigm in which the students participate actively and feedback is provided on their performance despite the very large number of enrolled students each year. Moreover, an Internet-based learning environment is an integral part of the larger course because it provides an opportunity to apply active learning methods. Examples of the active learning methods are algorithm simulations exercises and analysis of algorithms for small-scale problems. In addition, students design algorithms and solutions for non-trivial practical applications. Moreover, in the more advanced course they carry out a small-scale research project to determine the empirical efficiency of given algorithms and the corresponding data structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Malmi, L., Korhonen, A. (2008). Active Learning and Examination Methods in a Data Structures and Algorithms Course. In: Bennedsen, J., Caspersen, M.E., Kölling, M. (eds) Reflections on the Teaching of Programming. Lecture Notes in Computer Science, vol 4821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77934-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-77934-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77933-9
Online ISBN: 978-3-540-77934-6
eBook Packages: Computer ScienceComputer Science (R0)