Chunks 61 to 70

CHUNK 61
TITLE Classes 2
DESCRIPTION This part of the book should introduce the code behind a class; this will require teaching of the highest order. This is a repeat of the previous chunk. Classes are so dificult to understand so we have decided to repeat the teaching
OUTCOME

• Be able to understand the code of a simple class programmed in no more than 30 lines of code

REFERENCE Greenberg 304
HINT Try and describe a class that implements some simple graphics. Do enough teaching on constructors to get you throuugh but do not go to town on this: there will be more teaching on constructors later. Make the arguments lists a little more complicated than the previous chunk of the book, say three arguments maximum.
PROGRAM Difficult task: try and develop a class that is a little more complicated than the one that you describe and make it do something really visual.

CHUNK 62
TITLE Constructors
DESCRIPTION I want you to teach constructors in depth here. Show the student that a constructor is code that creates an object and assigns values to its attributes
OUTCOMES

• Be able to understand code within constructors containing no arguments and multi-arguments
• Be able to develop code within constructors containing no arguments and multi-arguments

REFERENCE Greenberg 309--311
HINT Use a class as an example. Make it no more than 50 lines of code. Try and get it to do something graphical
PROGRAM Develop a program similar to the one you describe

CHUNK 63
TITLE Methods 1
DESCRIPTION The student will have seen methods in action in the previous three chunks of the book. Describe them in more detail here. Plenty of small examples required. Describe methods with simple arguments such as int.
OUTCOMES

• Be able to understand simple methods containing simple argument lists
• Be able to develop methods containing simple argument lists

REFERENCE Greenberg 311--318
HINT Really take time explaining the role of an argument. This concept messes students up a lot. Show an example of a class that implements some graphical processing
PROGRAM Develop a program that issimilar in complexity to the one in the txt

CHUNK 64
TITLE Methods 2
DESCRIPTION The student will have seen methods in action in the previous three chunks of the book.Describe them in more detail here. Plenty of small examples required. Describe methods with more complex arguments such as arrays of ints.
OUTCOMES

• Be able to understand simple methods containing more complex argument lists
• Be able to develop methods containing more complex argument lists

REFERENCE Greenberg 311--318
HINT Use lots of small exampless
PROGRAM Develop a program similar to the one that you describe in the text.

CHUNK 65
TITLE Bringing it all together
DESCRIPTION In this part of the book I want you to develop a class which is around 100 lines of code. It should contain constructors with a number of arguments, methods with a number of argum ents, methodswhich are void and methods which deliver values. This brings the work on classes described in previous chunks together.
OUTCOMES
Be able to understand the code of a class of roughly 100 lines which contains the elements above.

• Be able to develop the code of a class of roughly 100 lines of code which contains the elements above.

REFERENCE Greenberg 302--318
HINT As with all these classes make the code do somthing graphic.
PROGRAM Develop a program similar to the one that you have explained in the text. Try and make it do something spectacular in graphical terms.

CHUNK 66
TITLE Shapes--an introduction
DESCRIPTION This part of the book introduces some of the 2D Processing shapes. Describe rectangle, ellipse, arc and triangle
OUTCOMES

• Be able to develop simple programs involving the shapes
• Be able to develop more complicated programs of up to 100 lines which show graphiceffects similar to those shown in the Greenber fragment below

REFERENCE Greenberg 340--349
HINT At all times try to show programs which show interesting graphic effects
PROGRAM Develop a program that uses at least two of the shapes to produce some stunning graphics. Don't do recursion

CHUNK 67
TITLE Name Transformations
DESCRIPTION In this part of the book describe how shapes can be transformed.
OUTCOME

• Be able to use the transformation facilities in Processing to transform shapes previoulsy introduced.

REFERENCE Greenberg 350--357
HINT Don't go into any details about matrices; just do as Greenberg does: say theres something called a matrix which is under the bonnet.
PROGRAM Develop a program that uses transformations of around 100-150 lines of code.

CHUNK 68
TITLE Hybrid shapes
DESCRIPTION This describes how interesting shapes can be constructed using combinations of p reviously described shapes.
OUTCOMES

• Be able to develop programs up to 100 lines which display combinations of shapes
• Be able to develop classes of up to 100 lines which display combinations of shapes

REFERENCE Greenberg 365--368
HINT Try and use classes for your code so that the student has more examples of this idea to look at.
PROGRAM Develop a class-based program that provides some interesting graphical effect.

CHUNK 69
TITLE Classes creating shapes
DESCRIPTION This part of the book gives the reader some more practice in writing and reading
OUTCOMES

• Be able to develop a class of around 100 lines of code that implements some new shape
• Be able to use objects defined by the class

REFERENCE Greenberg 378--381
HINT make this as much an exercise in class development as much as graphical programming
PROGRAM Develop a similar program to the one in the text

CHUNK 70
TITLE An introduction to colour
DESCRIPTION This is an introduction to the colour facilities in Processing.

OUTCOMES

• Be able to develop programs of around 100 lines involving colours.

REFERENCE Greenberg 400--406
HINT None
PROGRAM Try and develop a program that uses a variety of colours and the shapes that were taught in the previous section of the course. Shapes such as rectangle and ellipse