Problems in comprehending recursion and suggested solutions
Proceedings of the 6th annual conference on Innovation and technology in computer science education
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
A story-centered, learn-by-doing approach to software engineering education
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Computability Theory: An Introduction to Recursion Theory
Computability Theory: An Introduction to Recursion Theory
| Hi-index | 0.00 |
One of the primary aims of a college education is to foster students' ability to think critically and analytically. [1] Many computer science students struggle to understand fundamental principles and techniques such as recursion, inferring qualitative patterns from data, and mathematical induction over countably infinite sets. In this paper we illustrate all of the above while developing pedagogically rich solutions to a common example used in typical CS curricula: enumerating the rational numbers. We go deeper than typical curricula to help students to think like computer scientists do.