Tiling and recursion

Chu, I-Ping; Johnsonbaugh, Richard

doi:10.1145/31726.31770

Search citation statements

Order By: Relevance

Paper Sections

Select...

Discussion1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2014

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the Four-Color Theorem guarantees that four colors always suffice, this might not be the smallest number necessary. For example, Chu and Johnsonbaugh [3] gave an algorithm for tiling a 2 n × 2 n board without a square with L-trominoes colored in at most three colors.…”

Section: Discussionmentioning

confidence: 99%

Digging for algorithmic nuggets in the land of polyominoes

Levitin

2012

Proceedings of the 17th ACM Annual Conference on Innovation and Technology in Computer Science Education

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

Digging for algorithmic nuggets in the land of polyominoes

Levitin

2012

Proceedings of the 17th ACM Annual Conference on Innovation and Technology in Computer Science Education

View full text Add to dashboard Cite

show abstract

A Survey on Teaching and Learning Recursive Programming

Rinderknecht¹

2014

Informatics in Education

View full text Add to dashboard Cite

We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative paradigms and the distinction between control flow vs. data flow. We follow the researchers in stating the problem with base cases, noting the similarity with induction in mathematics, making concrete analogies for recursion, using games, visualizations, animations, multimedia environments, intelligent tutoring systems and visual programming. We cover the usage in schools of the Logo programming language and the associated theoretical didactics, including a brief overview of the constructivist and constructionist theories of learning; we also sketch the learners' mental models which have been identified so far, and non-classical remedial strategies, such as kinesthesis and syntonicity. We append an extensive and carefully collated bibliography, which we hope will facilitate new research.

show abstract

Tiling and recursion

Abstract: A tiling problem is presented that demonstrates the power of recursion in the design of algorithms. When implemented as a program, the solution can be shown using a computer graphics display.

Cited by 2 publications

References 3 publications

Digging for algorithmic nuggets in the land of polyominoes

Digging for algorithmic nuggets in the land of polyominoes

A Survey on Teaching and Learning Recursive Programming

Contact Info

Product

Resources

About