The algorithmic beauty of plants
The algorithmic beauty of plants
Scaling: a design pattern in introductory computer science courses
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
A Java visualiser class: incorporating algorithm visualisations into students' programs
ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
Using visualization to teach parallel algorithms
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Java resources for computer science instruction
ACM SIGCUE Outlook - Special issue on the working group reports of the 3rd annual SIGCSE/SIGCUE ITiCSE conference
Toolkits in first year computer science: a pedagogical imperative
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
Java resources for computer science instruction
ITiCSE-WGR '98 Working Group reports of the 3rd annual SIGCSE/SIGCUE ITiCSE conference on Integrating technology into computer science education
| Hi-index | 0.00 |
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science concepts. The resulting drawings give students a better understanding of the power of recursion as well as the rate of growth of time complexity with multiple successive recursive calls. We describe the exercise, the concepts that need to be addressed to solve the problems, and the results of using this exercise in our classes.