Affiliation:
1. Universidad Rey Juan Carlos
Abstract
Greedy algorithms constitute an apparently simple algorithm design technique, but its learning goals are not simple to achieve. We present a didactic method aimed at promoting active learning of greedy algorithms. The method is focused on the concept of selection function, and is based on explicit learning goals. It mainly consists of an experimental method and the interactive system, GreedEx, that supports it. We also present our experience of five years using the didactic method and the evaluations we conducted to refine it, which are of two kinds: usability evaluations of GreedEx and analysis of students’ reports. Usability evaluations revealed a number of opportunities of improvement for GreedEx, and the analysis of students’ reports showed a number of misconceptions. We made use of these findings in several ways, mainly: improving GreedEx, elaborating lecture notes that address students’ misconceptions, and adapting the class and lab sessions and materials. As a consequence of these actions, our didactic method currently satisfies its initial goals. The article has two main contributions. First, the didactic method itself can be valuable for computer science educators in their teaching of algorithms. Secondly, the refinement process we have carried out, which was a multifaceted, medium-term action research, can be of interest to researchers of technology-supported computing education, since it illustrates how the didactic method was integrated into our educational practice.
Funder
Ministerio de Economía y Competitividad
Publisher
Association for Computing Machinery (ACM)
Subject
Education,General Computer Science
Reference50 articles.
1. ACM Interim Review Task Force. 2008. Computer Science Curriculum 2008. http://www.acm.org//education/curricula/ComputerScience2008.pdf. ACM Interim Review Task Force. 2008. Computer Science Curriculum 2008. http://www.acm.org//education/curricula/ComputerScience2008.pdf.
2. AlgoViz.org. 2009. The algorithm visualization portal. http://algoviz.org/. AlgoViz.org. 2009. The algorithm visualization portal. http://algoviz.org/.
3. Anderson L. W. Krathwohl D. R. Airasian P. W. Cruikshank K. A. Pintrich P. R. Raths J. and Wittrock M. C. 2001. A Taxonomy for Learning Teaching and Assessing: A Revision of Bloom’s Taxonomy of Educational Objectives. Longman New York. Anderson L. W. Krathwohl D. R. Airasian P. W. Cruikshank K. A. Pintrich P. R. Raths J. and Wittrock M. C. 2001. A Taxonomy for Learning Teaching and Assessing: A Revision of Bloom’s Taxonomy of Educational Objectives . Longman New York.
4. On the role of proofs in a course on design and analysis of algorithms
5. Teaching algorithms
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Improving Interactive Instruction: Faculty Engagement Requires Starting Small and Telling All;Koli Calling '22: 22nd Koli Calling International Conference on Computing Education Research;2022-11-17
2. Students’ Emotions Using an Algorithm Experimentation Tool in the New Normal;2021 IEEE Global Engineering Education Conference (EDUCON);2021-04-21
3. Extending Instructional Support in an Algorithm Benchmarking System;2019 International Symposium on Computers in Education (SIIE);2019-11
4. Students' Misconceptions of Optimization Algorithms;Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education;2019-07-02
5. The GreedEx experience: Evolution of different versions for the learning of greedy algorithms;Computer Applications in Engineering Education;2018-07-16