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

• 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.

Ämnesord

SAMHÄLLSVETENSKAP  -- Utbildningsvetenskap -- Didaktik (hsv//swe)

SOCIAL SCIENCES  -- Educational Sciences -- Didactics (hsv//eng)

Nyckelord

reductions

algorithm visualization

assessment

dynamic programming

NP-completeness

pattern-oriented instruction

proofs

self-efficacy

Teknikvetenskapens lärande och kommunikation

Education and Communication in the Technological Sciences

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)