Evaluation of a Didactic Method for the Active Learning of Greedy Algorithms

An evaluation of the educational effectiveness of a didactic method for the active learning of greedy algorithms is presented. The didactic method sets students structured-inquiry challenges to be addressed with a specific experimental method, supported by the interactive system GreedEx. This didactic method has been refined over several years of use. Additional elements are lecture contents and the scheduling of classes and lab sessions. Learning gain in the topic of greedy algorithms was measured in the short term for two groups of students: an experimental group taught with the new didactic method, and a control group taught with a traditional approach. The results show a significant learning gain improvement in the experimental group, while the students taught with a traditional method had little learning gain. In addition, the levels of Bloom's taxonomy at which improvements occurred were identified. In the control group, improvements were found at the knowledge level. In the experimental group, however, improvements were found at the knowledge and the comprehension levels, although not at the analysis level. These results are encouraging and indicate directions for future research, as analysis skills are important in algorithm courses.

[1]  David Ginat Learning from wrong and creative algorithm design , 2008, SIGCSE '08.

[2]  J. Ángel Velázquez-Iturbide,et al.  Active learning of greedy algorithms by means of interactive experimentation , 2009, ITiCSE.

[3]  David Ginat The greedy trap and learning from mistakes , 2003, SIGCSE.

[4]  P. Lachenbruch Statistical Power Analysis for the Behavioral Sciences (2nd ed.) , 1989 .

[5]  J. Ángel Velázquez-Iturbide Refinement of an experimental approach tocomputer-based, active learning of greedy algorithms , 2012, ITiCSE '12.

[6]  J. Ángel Velázquez-Iturbide,et al.  Experimentation with optimization problems in algorithm courses , 2011, 2011 IEEE EUROCON - International Conference on Computer as a Tool.

[7]  J. Ángel Velázquez-Iturbide,et al.  The design and coding of greedy algorithms revisited , 2011, ITiCSE '11.

[8]  Michal Armoni On the role of proofs in a course on design and analysis of algorithms , 2006, ACM SIGCSE Bull..

[9]  Leon E. Winslow,et al.  Programming pedagogy—a psychological overview , 1996, SGCS.

[10]  Mark Guzdial,et al.  Computer Science Curriculum 2008: An Interim Revision of CS 2001 , 2008 .

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms, 3rd Edition , 2009 .

[12]  M. Herron,et al.  The Nature of Scientific Enquiry , 1971, The School Review.

[13]  J. Ángel Velázquez-Iturbide,et al.  GreedEx: A Visualization Tool for Experimentation and Discovery Learning of Greedy Algorithms , 2013, IEEE Transactions on Learning Technologies.

[14]  Carmen Torres-Blanc,et al.  PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm , 2008, PVW.

[15]  Jeannette M. Wing An introduction to computer science for non-majors using principles of computation , 2007, SIGCSE.