Active learning and examination methods in a data structures and algorithms course

4Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Malmi, L., & Korhonen, A. (2008). Active learning and examination methods in a data structures and algorithms course. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4821 LNCS, pp. 210–227). https://doi.org/10.1007/978-3-540-77934-6_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free