Experiments with proof plans for induction
Journal of Automated Reasoning
Semantics of sequential and parallel programs
Semantics of sequential and parallel programs
Data Structures and Problem Solving Using Java
Data Structures and Problem Solving Using Java
Distributed Algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Algorithms
Communications of the ACM - Why CS students need math
Proceedings of the 16th Western Canadian Conference on Computing Education
Hi-index | 0.00 |
Induction is an important concept for computer science and yet students have difficulties understanding it. The current literature on students' difficulties with induction is concerned with difficulties students have while proving a statement by induction. My research focuses on identifying difficulties that students may have prior to proving a statement. In particular, the present paper is concerned with students' understanding of the recursive/inductive definition of the elements the statement is about. My study is contextualized within the undergraduate computer science curriculum, and its results show that students' performance with proofs by induction improves after class instruction, but not as it would be desirable. Moreover, they suggest that students who understand recursive/inductive definitions can successfully perform a proof by induction, while students who do not are either not able to perform proofs by induction, or if they are, they do so mechanically. In addition, students' performance is affected by their past knowledge and experience, as well as the context in which a problem is presented.