Fundamentals of graph coloring are introduced, and four basic alternative algorithms for coloring undirected graphs are described in J, along with programs for generating, adjacency matrices and testing them. Results are compared, and suggestions for future development are offered.
This paper reports how we, two university teachers of APL, began to learn J. By presenting accounts of a series of small experiments, it reveals our understandings and misunderstandings along the way. It discusses things we especially liked and disliked about J as well as the resources available for learning it, and it indicates some implications of our… (More)
This article summarizes a teacher-education course which introduces J as a computer notation well-suited for teaching secondary mathematics. This one-semester course is designed as a series of workshops with accompanying discussions. The first workshop is described here in detail; the others are sketched. Teachers' experiences and reactions to using J are… (More)
In an effort to understand “APL thinking”, we examine a few selected examples of using APL to solve specific problems, namely: compute the median of a numerical vector; simulate the Replicate function; string search; carry forward work-to-be-done in excess of capacity; rotate concentric rectangular rings in a matrix; find column indices of… (More)