Iteratively Intervening with the “Most Difficult” Topics of an Algorithms and Complexity Course

Author:

Enström Emma1,Kann Viggo1ORCID

Affiliation:

1. KTH Royal Institute of Technology, Sweden

Abstract

When compared to earlier programming and data structure experiences that our students might have, the perspective changes on computers and programming when introducing theoretical computer science into the picture. Underlying computational models need to be addressed, and mathematical tools employed, to understand the quality criteria of theoretical computer science. Focus shifts from doing to proving. Over several years, we have tried to make this perspective transition smoother for the students of a third-year mandatory algorithms, data structures, and computational complexity course. The concepts receiving extra attention in this work are NP-completeness, one of the most central concepts in computer science, and dynamic programming, an algorithm construction method that is powerful but somewhat unintuitive for some students. The major difficulties that we attribute to NP-completeness are that the tasks look similar but have a different purpose than in algorithm construction exercises. Students do not immediately see the usefulness of the concept, and hence motivation could be one issue. One line of attacking NP-completeness has been to emphasize its algorithmic aspects using typical tools for teaching algorithms. Some potential difficulties associated with dynamic programming are that the method is based on a known difficult concept—recursion—and that there are many ingredients in a dynamic programming solution to a problem. For both dynamic programming and NP-completeness, we have invented several new activities and structured the teaching differently, forcing students to think and adopt a standpoint, and practice the concepts in programming assignments. Student surveys show that these activities are appreciated by the students, and our evaluations indicate that they have positive effects on learning. We believe that these activities could be useful in any similar course. The approach to improving the course is action research, and the evaluation has been done using course surveys, self-efficacy surveys, rubrics-like grading protocols, and grades. We have also interviewed teaching assistants about their experiences.

Funder

Communication in Engineering Science

GRU at the KTH School of Computer Science and Communication

CPU

RCN at the KTH School of Education

Publisher

Association for Computing Machinery (ACM)

Subject

Education,General Computer Science

Reference49 articles.

1. Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science

2. Reductive thinking in a quantitative perspective

3. Reductive thinking in undergraduate CS courses

4. An investigation of factors related to self-efficacy for Java programming among engineering students;Askar Petek;Turkish Online Journal of Educational Technology,2009

5. Aspects of proof in pupils’ practice of school mathematics;Balacheff Nicolas;Mathematics, Teachers and Children,1988

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Regulation, Self-Efficacy, and Participation in CS1 Group Work;Proceedings of the 2024 ACM Conference on International Computing Education Research - Volume 1;2024-08-12

2. Augmented reality with algorithm animation and their effect on students’ emotions;Multimedia Tools and Applications;2022-09-07

3. Student misconceptions of dynamic programming: a replication study;Computer Science Education;2022-06-19

4. Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy;Education and Information Technologies;2021-05-05

5. AlgoBOWL;Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education;2019-07-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3