Affiliation:
1. The Open University of Israel, Raanana Israel
Abstract
This paper discusses the role of proofs in a course on design and analysis of algorithms. It argues that correctness proofs should always be considered as an integral part of algorithmic solutions, which should otherwise be considered as incomplete. Proofs and proof strategies should be emphasized in such a course, and active proof production should be required of students. Such an emphasis can improve mathematical as well as algorithmic skills, and can demonstrate the important and unique role of mathematics within computer science.
Publisher
Association for Computing Machinery (ACM)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Studied Questions in Data Structures and Algorithms Assessments;Proceedings of the 2023 Conference on Innovation and Technology in Computer Science Education V. 1;2023-06-29
2. Evaluation of a Didactic Method for the Active Learning of Greedy Algorithms;IEEE Transactions on Education;2014-05
3. An Experimental Method for the Active Learning of Greedy Algorithms;ACM Transactions on Computing Education;2013-11