Try to solve the following problems in your favorite non-J language, then doing the same in J. Problems are posed for APL but work just as well for J. http://www.jsoftware.com/papers/APL_exercises/
2.5 Cantor Set Write a function to compute the Cantor set of order n, n>:0. Cantor 0 1 Cantor 1 1 0 1 Cantor 2 1 0 1 0 0 0 1 0 1 Cantor 3 1 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 1 2.6 Sierpinski Carpet Write a function to compute the Sierpinski Carpet of order n, n>:0. SC 0 1 SC 1 1 1 1 1 0 1 1 1 1 SC 2 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 0 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 2.7 Extended H Write a function for the extend H algorithm for n , n>:0 , which embeds the complete binary tree of depth n on the plane. In xH n there are 2^n leaves, instances of the letter o with exactly one neighbor (or no neighbors for 0=n). The root is at the center of the matrix. xH each i.5 ┌─┬─────┬─────┬─────────────┬─────────────┐ │o│o-o-o│o o│o-o-o o-o-o│o o o o│ │ │ │| |│ | | │| | | |│ │ │ │o-o-o│ o---o---o │o-o-o o-o-o│ │ │ │| |│ | | │| | | | | |│ │ │ │o o│o-o-o o-o-o│o | o o | o│ │ │ │ │ │ | | │ │ │ │ │ │ o---o---o │ │ │ │ │ │ | | │ │ │ │ │ │o | o o | o│ │ │ │ │ │| | | | | |│ │ │ │ │ │o-o-o o-o-o│ │ │ │ │ │| | | |│ │ │ │ │ │o o o o│ └─┴─────┴─────┴─────────────┴─────────────┘ On Wed, Nov 29, 2017 at 7:31 PM, Dabrowski, Andrew John < [email protected]> wrote: > Well I teach some mid-level math courses that can benefit from simple > computer demos: fractals, math modeling (e.g. Markov Chains, queuing, > Spirograph(!)). > > I also need to write occasional scripts to help with scantron exams for > the dept. > > Personally I'm interested in computer assisted music. > On 11/28/2017 04:44 PM, Roger Hui wrote: > > Andrew Dabrowski: What topics of mathematics are you most interested in? > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
