This part of the blog shows each chunk and the URL of the blog associated with it. if you look at each blog you should see versions of that chunk. if you see the text 'No blog assigned' then it is free for you to take possession and start writing. Please email us if you want to write a chunk.
Updated 26th April
Chunk 1
Mike Taperell
Chunk 2
Roberto Vormittag
Chunk 3
Stewart Edwards
Chunk 4
Samir Rabab
Chunk 5
Alex Harris
Chunk 6
Sheep Dalton
Chunk 7
Mike Richards
Chunk 8
Bryan Clifton
Chunk 9
Edward Toovey
Chunk 10
Graham Hall
Chunk 11
JeanLuc Brausch
Chunk 12
James Gray
Chunk 13
Anthony Lees
Chunk 14
Geoff Riley
Chunk 15
Bruce Lawley
Chunk 16
Rosie Wood
Chunk 17
Alex Harris
Chunk 18
Fokion Zervoudakis
Chunk 19
Neil Petrie
Chunk 20
Antony Lees
Chunk 21
David Phillips
Chunk 22
Neil Keskar
Chunk 23
Daniel Bergmann
Chunk 24
Darrel Ince
Chunk 25
Pat Jacobs
Chunk 26
Grant Mankee
Chunk 27
Charlie Beddoes
Chunk 28
Simon Perrins
Chunk 29
Rosseleyne Thompson
Chunk 30
Rosseleyne Thompson
Chunk 31
Paul Fisher
Chunk 32
Anthony Fiore
Chunk 33
Ben Notorianni
Chunk 34
Bryn Sadler
Chunk 35
Anton Dil
Chunk 36
Martin Humby
Chunk 37
Martin Humby
Chunk 38
Neil Keskar
Chunk 39
Mark Moran
Chunk 40
Ian Welch
Chunk 41
Andrew Hancox
Chunk 42
Martin Prout
Chunk 43
Boyd Stratton
Chunk 44
Paul Fisher
Chunk 45
Ben Notorianni
Chunk 46
Rosie Wood
Chunk 47
Anthony Lees
Chunk 48
Anthony Lees
Chunk 49
Pat Jacobs
Chunk 50
John Rayfield
Chunk 51
Neil Singh
Chunk 52
Mark Miller
Chunk 53
Anabela Green
Chunk 54
Rebecca Ewen
Chunk 55
Barry Martin
Chunk 56
Paul Richards
Chunk 57
Davide Rizzo
Chunk 58
John Wilson
Chunk 59
Bryan Clifton
Chunk 60
Ebtessam Adam Alsomali
Chunk 61
Rob Martin
Chunk 62
Ian Macey
Chunk 63
Paulo Greco
Chunk 64
Liam Madden
Chunk 65
Boyd Stratton
Chunk 66
Jeremy Annis
Chunk 67
Sharon Dawes
Chunk 68
Martin Prout
Chunk 69
Shailesh Ghokale
Chunk 70
Rob Spain
Chunk 71
Mike Blamires
Chunk 72
Maxemilian Hilbrand
Chunk 73
Richard Brown
Chunk 74
Marshall Heap
Chunk 75
Antonio Bruno
Chunk 76
Marshall Heap
Chunk 77
Darragh Buffini
Chunk 78
Darragh Buffini
Chunk 79
Rosie Wood
Chunk 80
Dusan Licer
Chunk 81
Ian Perkins
Chunk 82
Anthony Lees
Chunk 83
Jannetta Steyn
Chunk 84
Jannetta Steyn
Chunk 85
Nigel Parker
Monday, September 8, 2008
Sunday, September 7, 2008
Chunks 81 to 85
CHUNK 81
TITLE Object orientation and images
DESCRIPTION In this part of the book show how you can develop a class based Processing program that manipulates images. This would be valuable revision on OO concepts.
OUTCOME
HINT It would do no harm to make the program the same level of complexity as that in the Greenberg extract
PROGRAM A similar program to that found in the text,
CHUNK 82
TITLE Mouse events
DESCRIPTION This is the first part of the book that looks at mouse events. Happily Processing handles such events easily
OUTCOMES
HINT Don't worry about showing how complex the mouse event code in Java is (Greenberg 564--565) just go straight into a description of the Processing code. Don't use any motion code unless its very simple as we have not covered this in the book
PROGRAM Develop a program similar to the one that you describe in this part of the book.
CHUNK 83
TITLE Buttons
DESCRIPTION Buttons are useful elements to have. Unfortunately the standard button code used in Java cannnot be used in Processing. You have to draw them
OUTCOME
HINT Take the teaching very gently and dont tear your hair out when you realise that you can't use Swing or AWT widgets.
PROGRAM Develop a similar program to the one you describe in the text. Make it class based.
CHUNK 84
TITLE Advanced buttons 1
DESCRIPTION You will need to describe a similar program to the one detailed in the Greenberg extract below. Working with sophisticated buttons is really painstaking in Processing Im afraid.
OUTCOME
HINT Take it very gently: build up the program gradually as the code while not being intellectually difficult is somewhat complicated
PROGRAM A program similar in complexity to the one that you describe in the text.
CHUNK 85
TITLE Advanced buttons 2
DESCRIPTION You will need to describe a similar program to the one detailed in the Greenberg extract below. Working with sophisticated buttons is really painstaking in Processing Im afraid. This is a similar version to the previous chunk of the book. You may need to liase a bit with the author of chunk 84. Like 84 this is jst the description of a sophisticated program.
OUTCOME
HINT Take it very gently: build up the program gradually as the code while not being intellectually difficult is somewhat complicated
PROGRAM A program similar in complexity to the one that you describe in the text.
TITLE Object orientation and images
DESCRIPTION In this part of the book show how you can develop a class based Processing program that manipulates images. This would be valuable revision on OO concepts.
OUTCOME
- Be able to develop an OO-based program of no more than 120 lines which manipulates images.
HINT It would do no harm to make the program the same level of complexity as that in the Greenberg extract
PROGRAM A similar program to that found in the text,
CHUNK 82
TITLE Mouse events
DESCRIPTION This is the first part of the book that looks at mouse events. Happily Processing handles such events easily
OUTCOMES
- Be able to understand how Processing is able to detect and act on mouse events.
- Be able to develop a program up to 120 lines which relies on mouse events bein caught.
HINT Don't worry about showing how complex the mouse event code in Java is (Greenberg 564--565) just go straight into a description of the Processing code. Don't use any motion code unless its very simple as we have not covered this in the book
PROGRAM Develop a program similar to the one that you describe in this part of the book.
CHUNK 83
TITLE Buttons
DESCRIPTION Buttons are useful elements to have. Unfortunately the standard button code used in Java cannnot be used in Processing. You have to draw them
OUTCOME
- Be able to understand how Processing implements buttons
- Be able to develop a Processing program of no more than 120 lines that includes two buttons.
HINT Take the teaching very gently and dont tear your hair out when you realise that you can't use Swing or AWT widgets.
PROGRAM Develop a similar program to the one you describe in the text. Make it class based.
CHUNK 84
TITLE Advanced buttons 1
DESCRIPTION You will need to describe a similar program to the one detailed in the Greenberg extract below. Working with sophisticated buttons is really painstaking in Processing Im afraid.
OUTCOME
- Be able to develop a sophisticated button-based Processing program of no more than 200 lines.
HINT Take it very gently: build up the program gradually as the code while not being intellectually difficult is somewhat complicated
PROGRAM A program similar in complexity to the one that you describe in the text.
CHUNK 85
TITLE Advanced buttons 2
DESCRIPTION You will need to describe a similar program to the one detailed in the Greenberg extract below. Working with sophisticated buttons is really painstaking in Processing Im afraid. This is a similar version to the previous chunk of the book. You may need to liase a bit with the author of chunk 84. Like 84 this is jst the description of a sophisticated program.
OUTCOME
- Be able to develop a sophisticated button based Processing program of no more than 200 lines
HINT Take it very gently: build up the program gradually as the code while not being intellectually difficult is somewhat complicated
PROGRAM A program similar in complexity to the one that you describe in the text.
Chunks 71 to 80
CHUNK 71
TITLE Alpha transparency
DESCRIPTION This describes the use of the alpha component of a colour to vary its transparency.
OUTCOME
HINT Try and find an example where you dont have to go into much detail on matrices.If you do then make sure its no more than that in the Greenberg extract here.
PROGRAM Develop a program similar to the one you describe in the text.
CHUNK 72
TITLE Colour modes
DESCRIPTION This part of the book is an introduction to the idea of a color mode.
OUTCOMES
HINT No hint
PROGRAM Develop a program that uses a number of different colour modes and produces some interesting or spectacular effects.
CHUNK 73
TITLE More colour functions
DESCRIPTION This describes a range of new colour functions
OUTCOMES
HINT Don't worry about explaining bitwise approaches as the author does; just mention the
slowness.
PROGRAM Develop a program based on a class that does some spectacular or interesting graphical effects. No more than 150 lines.
CHUNK 74
TITLE Pixels
DESCRIPTION So far we have been looking at Pixels, now we will look at bit mapped images. This is the introduction.
OUTCOMES
HINT Develop a gradient-based program similar to those shown in the Greenberg extract
PROGRAM Develop a program similar to the one that you have described in the text.
CHUNK 75
TITLE Faster pixels
DESCRIPTION One of the problems with the functions in the previous chunk of the book is that they are slow. This part of the book looks at how to speed things up
OUTCOMES
HINT Try describing a program that shimmers a bit, if you cant then its up to you what you do.
PROGRAM Develop a class-based program that is similar to the one you described min the text
CHUNK 76
TITLE Loading and tiling images
DESCRIPTION This is the start of the part of the book that deals with image manipulation. It shows you how load images and set and get the pixels in an image.
OUTCOMES
HINT This may be more than 2000 words so feel free to go as far as 3000 words.
PROGRAM A program, does not need to be class based, to do something to an image.
CHUNK 77
TITLE Using bits
DESCRIPTION This is a low level part of the book that will show students how to speed up image processing using bits.
OUTCOMES
HINT Take the explanation of binary representations quite slow
PROGRAM Develop a program similar to the one you describe in the text. It does not have to class-based
CHUNK 78
TITLE Using the mask method
DESCRIPTION The mask method enables the Processing programmer to implement some sophisticated functionality. This part of the book describes it.
OUTCOME
HINT Try and describe a program that implements some Photoshp functionality
PROGRAM Develop a program similar to the one described in the text.
CHUNK 79
TITLE Using the filter method
DESCRIPTION This should be a gentle introduction to the filter method.
OUTCOMES
HINT Take this gradually and build up the described program in small chunks.
PROGRAM Develop an interesting program similar to the one that you describe in the text.
CHUNK 80
TITLE Using the blend method
DESCRIPTION This should be a gentle introduction to the blend method.
OUTCOMES
HINT Take this gradually and build up the described program in small chunks. Show the student how to save the images that have been created.
PROGRAM Develop an interesting program similar to the one that you describe in the text.
TITLE Alpha transparency
DESCRIPTION This describes the use of the alpha component of a colour to vary its transparency.
OUTCOME
- Be able to develop a program of around 100-120 lines which employs transparency
HINT Try and find an example where you dont have to go into much detail on matrices.If you do then make sure its no more than that in the Greenberg extract here.
PROGRAM Develop a program similar to the one you describe in the text.
CHUNK 72
TITLE Colour modes
DESCRIPTION This part of the book is an introduction to the idea of a color mode.
OUTCOMES
- Be able to understand the idea of a colour mode.
- Be able to employ a number of different colour modes in a computer program
HINT No hint
PROGRAM Develop a program that uses a number of different colour modes and produces some interesting or spectacular effects.
CHUNK 73
TITLE More colour functions
DESCRIPTION This describes a range of new colour functions
OUTCOMES
- Be able to use functions such as blendColor in Processing programs
- Be able to develop Processing programs of around 100-120 lines using the colour functions detailed here.
HINT Don't worry about explaining bitwise approaches as the author does; just mention the
slowness.
PROGRAM Develop a program based on a class that does some spectacular or interesting graphical effects. No more than 150 lines.
CHUNK 74
TITLE Pixels
DESCRIPTION So far we have been looking at Pixels, now we will look at bit mapped images. This is the introduction.
OUTCOMES
- Be able to understand the difference between bit-mapped and vector graphics.
- Be able to use the pixel functions detailed in this part of the book.
- Be able to develop a program that uses pixels of around 120 lines of code
HINT Develop a gradient-based program similar to those shown in the Greenberg extract
PROGRAM Develop a program similar to the one that you have described in the text.
CHUNK 75
TITLE Faster pixels
DESCRIPTION One of the problems with the functions in the previous chunk of the book is that they are slow. This part of the book looks at how to speed things up
OUTCOMES
- Be able to use the functions detailed in the Greenberg fragment below
- Be able to develop a program of no more than 120 lines of Processing code which uses the pixel array stuff in the fragment below.
HINT Try describing a program that shimmers a bit, if you cant then its up to you what you do.
PROGRAM Develop a class-based program that is similar to the one you described min the text
CHUNK 76
TITLE Loading and tiling images
DESCRIPTION This is the start of the part of the book that deals with image manipulation. It shows you how load images and set and get the pixels in an image.
OUTCOMES
- Be able to use program facilities to load an image
- Be able to use set and get functions to manipulate an image.
- Be able to develop programs of no more than 120 lines which use the facilities in the Greenberg fragment
HINT This may be more than 2000 words so feel free to go as far as 3000 words.
PROGRAM A program, does not need to be class based, to do something to an image.
CHUNK 77
TITLE Using bits
DESCRIPTION This is a low level part of the book that will show students how to speed up image processing using bits.
OUTCOMES
- Be able to understand how colours are represented as bits.
- Be able to develop a program of no more than 120 linesusing bitwise operations.
HINT Take the explanation of binary representations quite slow
PROGRAM Develop a program similar to the one you describe in the text. It does not have to class-based
CHUNK 78
TITLE Using the mask method
DESCRIPTION The mask method enables the Processing programmer to implement some sophisticated functionality. This part of the book describes it.
OUTCOME
- Be able to develop a program of no more than 120 lines that uses the mask method.
HINT Try and describe a program that implements some Photoshp functionality
PROGRAM Develop a program similar to the one described in the text.
CHUNK 79
TITLE Using the filter method
DESCRIPTION This should be a gentle introduction to the filter method.
OUTCOMES
- Be able to understand the function of the filter method
- Be able to develop a program of no more than 120 lines using the filter method
HINT Take this gradually and build up the described program in small chunks.
PROGRAM Develop an interesting program similar to the one that you describe in the text.
CHUNK 80
TITLE Using the blend method
DESCRIPTION This should be a gentle introduction to the blend method.
OUTCOMES
- Be able to understand the function of the blend method
- Be able to develop a program of no more than 120 lines using the blend method
HINT Take this gradually and build up the described program in small chunks. Show the student how to save the images that have been created.
PROGRAM Develop an interesting program similar to the one that you describe in the text.
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
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
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
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
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.
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
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
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
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
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
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
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
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
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
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
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.
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
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.
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
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
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.
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
Chunks 51 to 60
CHUNK 51
TITLE A curve example 1
DESCRIPTION Describe a program that uses the curve drawing idea in Greenberg 246--249, make it relatively complex of around 100 lines of code.
OUTCOME
HINT Try and make this program visually good, for example use colour
PROGRAM Modify the program that you present in this part of the book so that it does something different
CHUNK 52
TITLE A curve example 2
DESCRIPTION Describe a program that uses the curve drawing idea in Greenberg 246--249, make it relatively complex around 150 lines of code.
OUTCOME
HINT Try and make this program visually good, for example use colour
PROGRAM Modify the program that you present in this part of the book so that it does something different.
CHUNK 53
TITLE Using trigonometric functions
DESCRIPTION Describe the three trigonometric functions sin, cos and tan. Dont worry about explaining them in terms of triangles just describe them as functions which have certain drawing properties. Develop a simple program that shows these functions being drawn.
OUTCOME
HINT Don't go into any of the mathematics of the trig functions
PROGRAM Develop a program similar in complexity to the one that you describe.
CHUNK 54
TITLE Sin in action
DESCRIPTION Describe a program that is similar in complexity to that Greenberg 257--260.
OUTCOME
HINT Don't copy the program in Greenberg try and develop something of the same complexity but which is rather different.
PROGRAM Modify the program that you describe so that its functionality is changed.
CHUNK 55
TITLE Polynomials
DESCRIPTION Describe the gneral form of quadratic and cubic polynomials and show how they can be drawn using the techniques in Greenberg 262--267. Describe a simple program that shows the various curves that are generated by such polynomials
OUTCOME
HINT Keep the programs simple.
PROGRAM No program required.
CHUNK 56
TITLE An introduction to Processing's curve functions
DESCRIPTION In this you should provide an introduction to curve drawing using the arc method. At this stage keep the description simple and concentrate on some simple examples
OUTCOMES
HINT Students might be a bit stunned by the mathematical aspects of curves; so keep the examples simple
PROGRAM Develop a more complicated program using the arc method.
CHUNK 57
TITLE The Bezier function 1
DESCRIPTION The Bezier function is a really tough topic. Only volunteer for this one if you feel that you have the mathematical ability and the teaching ability to convey a tough subject
OUTCOMES
HINT Try and describe a program simpler than that on Greenberg 275-276
PROGRAM Develop a program that is similar in complexity to the one that you use in the text
CHUNK 58
TITLE The Bezier function 2
DESCRIPTION In this part of the book I would like you to show how Bezier curves can be joined together. Employ programming that creates a number of joined curves. Also show how by using higher order polynomials you can to roughly the same thing
OUTCOMES
HINT Take this very gently and try to eliminate the mathematics
PROGRAM Develop an animation that uses Bezier curves. Anything will do hter, it doesnt have to be one which joins up a series of Bezier curves.
CHUNK 59
TITLE An introduction to object-oriented programming
DESCRIPTION Make this an introduction, dont show the code for any classes, just get the student to understand there are objects and there are methods which correspond to messages. The BurritoRecipe class will be your inspiration; use a different example though.
OUTCOMES
HINT
Take this very gently, students everyehwere and at every level have problems with object orientation.
PROGRAM Don't write a program for this part of the book.
CHUNK 60
TITLE Classes 1
DESCRIPTION This part of the book should introduce the code behind a class; this will require teaching of the highest order.
OUTCOME
HINT Try and describe a class that implements some simple graphics. Do enough teaching on constructor to get you thorugh but do not go to town on this: there will be more teaching on constructors later. Make the argument lists for the methods simple (perhaps just one or two arguments).
PROGRAM A 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.
TITLE A curve example 1
DESCRIPTION Describe a program that uses the curve drawing idea in Greenberg 246--249, make it relatively complex of around 100 lines of code.
OUTCOME
- Be able to understand a moderately complex curve drawing program
HINT Try and make this program visually good, for example use colour
PROGRAM Modify the program that you present in this part of the book so that it does something different
CHUNK 52
TITLE A curve example 2
DESCRIPTION Describe a program that uses the curve drawing idea in Greenberg 246--249, make it relatively complex around 150 lines of code.
OUTCOME
- Be able to understand a moderately complex curve drawing program
HINT Try and make this program visually good, for example use colour
PROGRAM Modify the program that you present in this part of the book so that it does something different.
CHUNK 53
TITLE Using trigonometric functions
DESCRIPTION Describe the three trigonometric functions sin, cos and tan. Dont worry about explaining them in terms of triangles just describe them as functions which have certain drawing properties. Develop a simple program that shows these functions being drawn.
OUTCOME
- Understand the nature of trigonometric functions.
- Understand Processing programs that contain trigonometric funtions.
HINT Don't go into any of the mathematics of the trig functions
PROGRAM Develop a program similar in complexity to the one that you describe.
CHUNK 54
TITLE Sin in action
DESCRIPTION Describe a program that is similar in complexity to that Greenberg 257--260.
OUTCOME
- Be able to understand a complex Processing program
HINT Don't copy the program in Greenberg try and develop something of the same complexity but which is rather different.
PROGRAM Modify the program that you describe so that its functionality is changed.
CHUNK 55
TITLE Polynomials
DESCRIPTION Describe the gneral form of quadratic and cubic polynomials and show how they can be drawn using the techniques in Greenberg 262--267. Describe a simple program that shows the various curves that are generated by such polynomials
OUTCOME
- Describe the general form of a polynomial
- Develop code that draws a particular polynomial.
HINT Keep the programs simple.
PROGRAM No program required.
CHUNK 56
TITLE An introduction to Processing's curve functions
DESCRIPTION In this you should provide an introduction to curve drawing using the arc method. At this stage keep the description simple and concentrate on some simple examples
OUTCOMES
- Describe the role of the curve functions in Processing
- Use the arc method in simple programs no more than 30 lines in length
HINT Students might be a bit stunned by the mathematical aspects of curves; so keep the examples simple
PROGRAM Develop a more complicated program using the arc method.
CHUNK 57
TITLE The Bezier function 1
DESCRIPTION The Bezier function is a really tough topic. Only volunteer for this one if you feel that you have the mathematical ability and the teaching ability to convey a tough subject
OUTCOMES
- Understand how curves are defined by Bezier functions
- Develop programs of no more than 30 lines using Bezier functions
HINT Try and describe a program simpler than that on Greenberg 275-276
PROGRAM Develop a program that is similar in complexity to the one that you use in the text
CHUNK 58
TITLE The Bezier function 2
DESCRIPTION In this part of the book I would like you to show how Bezier curves can be joined together. Employ programming that creates a number of joined curves. Also show how by using higher order polynomials you can to roughly the same thing
OUTCOMES
- Develop a simple program of no more than 40 lines which joins up Bezier curves
- Develop a simple program of no more than 40 lines creates a Bezier function from a higher order function
HINT Take this very gently and try to eliminate the mathematics
PROGRAM Develop an animation that uses Bezier curves. Anything will do hter, it doesnt have to be one which joins up a series of Bezier curves.
CHUNK 59
TITLE An introduction to object-oriented programming
DESCRIPTION Make this an introduction, dont show the code for any classes, just get the student to understand there are objects and there are methods which correspond to messages. The BurritoRecipe class will be your inspiration; use a different example though.
OUTCOMES
- Understand the broad idea of a class.
- Understand the broad idea of a method
- Understand the broad idea of a message
HINT
Take this very gently, students everyehwere and at every level have problems with object orientation.
PROGRAM Don't write a program for this part of the book.
CHUNK 60
TITLE Classes 1
DESCRIPTION This part of the book should introduce the code behind a class; this will require teaching of the highest order.
OUTCOME
- Be able to understand the code of a simple class programmed in no more than 30 lines of code
HINT Try and describe a class that implements some simple graphics. Do enough teaching on constructor to get you thorugh but do not go to town on this: there will be more teaching on constructors later. Make the argument lists for the methods simple (perhaps just one or two arguments).
PROGRAM A 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.
Chunks 41 to 50
CHUNK 41
TITLE Vertex functions 1
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 50 lines of code which uses vertex functions.
OUTCOME
HINT Use anti-aliasing
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 42
TITLE Vertex functions 2
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 75 lines of code which uses vertex functions.Try and make it concepuually similar to that found in Greenberg 220--221 but more complicated
OUTCOME
HINT Don't worry about the kludgy approach.
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 43
TITLE Vertex functions 3
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in Greenberg 224--225 but more complicated
OUTCOME
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 44
TITLE Vertex functions 4
DESCRIPTION
This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in the program in Greenberg 231 but more complicated
OUTCOME
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 45
TITLE Vertex functions 5
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found to the program in Greenberg 235 but more complicated
OUTCOME
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 46
TITLE Bringing it together 1
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed
CHUNK 47
TITLE Bringing it together 2
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed.
CHUNK 48
TITLE Bringing it together 3
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed
CHUNK 49
TITLE Lines and acceleration
DESCRIPTION Provide a little revision on lines the way that Greenberg does about lines. Describe a line as a series of points and develop a program that gnerates a series of lines as points
OUTCOME
HINT Talk about a line being a distance vs time graph and the slope the acceleration
PROGRAM No program needed
CHUNK 50
TITLE Generating a simple curve
DESCRIPTION Use the idea of a curve having acceleration in two directions to generate a simple curve. Describe a program that generates a number of curves in an interesting way.
OUTCOME
HINT You may like to use different colours
PROGRAM Develop another program that is similar in complexity to the one that you describe.
TITLE Vertex functions 1
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 50 lines of code which uses vertex functions.
OUTCOME
- Be able to understand a program that uses vertex functions.
HINT Use anti-aliasing
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 42
TITLE Vertex functions 2
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 75 lines of code which uses vertex functions.Try and make it concepuually similar to that found in Greenberg 220--221 but more complicated
OUTCOME
- Be able to understand a program that uses vertex functions.
HINT Don't worry about the kludgy approach.
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 43
TITLE Vertex functions 3
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in Greenberg 224--225 but more complicated
OUTCOME
- Be able to understand a program that uses vertex functions.
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 44
TITLE Vertex functions 4
DESCRIPTION
This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found in the program in Greenberg 231 but more complicated
OUTCOME
- Be able to understand a program that uses vertex functions.
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 45
TITLE Vertex functions 5
DESCRIPTION This is one of five sections of the book that provides examples in the use of vertex functions. Describe a program that is about 100 lines of code which uses vertex functions. Try and make it conceptually similar to that found to the program in Greenberg 235 but more complicated
OUTCOME
- Be able to understand a program that uses vertex functions.
HINT Might be worth looking at drawing in different colours
PROGRAM Modify the program that you present in the text so that its functionality changes
CHUNK 46
TITLE Bringing it together 1
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
- Understand a large Processing program
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed
CHUNK 47
TITLE Bringing it together 2
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
- Understand a large Processing program
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed.
CHUNK 48
TITLE Bringing it together 3
DESCRIPTION This is a really difficult section. What we want you to do is to develop a program of about 200 lines which is visually stunning and which uses any of Processing's line functions.
OUTCOME
- Understand a large Processing program
HINT Don't attempt this unless you really feel that you are a practised Java programmer.
PROGRAM No program needed
CHUNK 49
TITLE Lines and acceleration
DESCRIPTION Provide a little revision on lines the way that Greenberg does about lines. Describe a line as a series of points and develop a program that gnerates a series of lines as points
OUTCOME
- Be able to develop a simple program that generates a loine from a series of points
HINT Talk about a line being a distance vs time graph and the slope the acceleration
PROGRAM No program needed
CHUNK 50
TITLE Generating a simple curve
DESCRIPTION Use the idea of a curve having acceleration in two directions to generate a simple curve. Describe a program that generates a number of curves in an interesting way.
OUTCOME
- Develop a program that generates simple curves.
HINT You may like to use different colours
PROGRAM Develop another program that is similar in complexity to the one that you describe.
Chunks 31 to 40
CHUNK 31
TITLE An introduction to modes
DESCRIPTION Briefly describe the three rendering modes in Processing. Then describe a program that illustrates the use of JAVA2D mode. Include the use of functions in this. Make the complexity similar to the program shown in Greenberg 162--163. Also describe some of the functions asociated with JAVA2D
OUTCOMES
HINT Make the program that you describe similar to that in Greenberg 162--163,
PROGRAM Develop another program similar in complexity to the one you describe in the text.
CHUNK 32
TITLE P3D mode
DESCRIPTION Describe the P3D mode. Use a simple program that illustrates the mode. Make the program of the same complexity as that in Greenberg 164--165. Also describe some of the functions associated with this rendering mode
OUTCOME
HINT Try and use a variety of functions, say no more than eight.
PROGRAM Develop a program similar to that described in your text.
CHUNK 33
TITLE OPENGL mode
DESCRIPTION Describe this mode. Be aware that we will not be looking at 3-d graphics in much detail later so this will be one of the few opportunities that the reader will see 3-d programs. Describe a simple program that uses the facilities of OPENGL. Make it simpler than the example in Greenberg 166--169.
OUTCOME
HINT Take the decription of the code very gently.
PROGRAM Develop a program similar in complexity to the one you describe in the text.
CHUNK 34
TITLE Programs with points 1
DESCRIPTION Greenberg 174--184 describes programs which are based on the display of points. Describe a program that could have been written of this section. Make sure that you use plenty of loops and describe in detail what they do.
OUTCOME
HINT Try and reinforce the students knowledge of loops, teach loops very gently the student will only have a brief knowedge of them
PROGRAM Develop a progam similar in complexity to the one that you describe.
CHUNK 35
TITLE Programs with points 2
DESCRIPTION Greenberg 174--184 describes programs which are based on the display of points. Describe a program that could have been written of this section. Make sure that you use plenty of loops and describein detail what they do. Try and use some arrays in this part of the book.
OUTCOME
HINT Try and reinforce the students knowledge of loops and arrays, teach them very gentlythe student will only have a brief knowedge of them
PROGRAM Develop a progam similar in complexity to the one that you describe.
CHUNK 36
TITLE Drawing lines 1
DESCRIPTION First describe Processing's line functions. Then describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops
OUTCOMES
HINT This is quite a substantial amount of work. Try and explain any loops in the program you present gently: the reader is still getting used to them.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 37
DESCRIPTION Describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops and some arrays.
OUTCOME
HINT This is quite a substantial amount of work. Try and explain any loops and arrays in the program you present gently: the reader is still getting used to them.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 38
TITLE Drawing lines 3
DESCRIPTION Describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops and some arrays.
OUTCOME
HINT The previous two chunks of the text will have taught loops and arrays so assume that the reader is happy with these concepts.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 39
TITLE Two dimensional arrays
DESCRIPTION The reader will be used to single dimensional arrays. Teach them about two-dimensional arrays at this point in the book. Use a simple program to illustrate the use of such arrays.
OUTCOMES
HINT Perhaps use a simple shape drawing program that stores x and y coordinates in a two-dimensional array
PROGRAM Develop a progrm similar to the one you describe in the text
CHUNK 40
TITLE Vertex functions
DESCRIPTION Describe the concept of a vertex function and provide a programming example more complex than the one found in Greenberg 211--212.
OUTCOMES
PROGRAM Develop a program similar to the one that you use in the text.
TITLE An introduction to modes
DESCRIPTION Briefly describe the three rendering modes in Processing. Then describe a program that illustrates the use of JAVA2D mode. Include the use of functions in this. Make the complexity similar to the program shown in Greenberg 162--163. Also describe some of the functions asociated with JAVA2D
OUTCOMES
- To detail the differences between the the three main rendering modes in Processing.
- To use some of the facilities in JAVA2D to develop simple Processing programs
HINT Make the program that you describe similar to that in Greenberg 162--163,
PROGRAM Develop another program similar in complexity to the one you describe in the text.
CHUNK 32
TITLE P3D mode
DESCRIPTION Describe the P3D mode. Use a simple program that illustrates the mode. Make the program of the same complexity as that in Greenberg 164--165. Also describe some of the functions associated with this rendering mode
OUTCOME
- Employ selected facilities of P3D to develop simple Processing programs.
HINT Try and use a variety of functions, say no more than eight.
PROGRAM Develop a program similar to that described in your text.
CHUNK 33
TITLE OPENGL mode
DESCRIPTION Describe this mode. Be aware that we will not be looking at 3-d graphics in much detail later so this will be one of the few opportunities that the reader will see 3-d programs. Describe a simple program that uses the facilities of OPENGL. Make it simpler than the example in Greenberg 166--169.
OUTCOME
- Broadly describe the main functions of the OPENGL mode.
HINT Take the decription of the code very gently.
PROGRAM Develop a program similar in complexity to the one you describe in the text.
CHUNK 34
TITLE Programs with points 1
DESCRIPTION Greenberg 174--184 describes programs which are based on the display of points. Describe a program that could have been written of this section. Make sure that you use plenty of loops and describe in detail what they do.
OUTCOME
- Develop a program similar in complexity to the one described in this part of the book
HINT Try and reinforce the students knowledge of loops, teach loops very gently the student will only have a brief knowedge of them
PROGRAM Develop a progam similar in complexity to the one that you describe.
CHUNK 35
TITLE Programs with points 2
DESCRIPTION Greenberg 174--184 describes programs which are based on the display of points. Describe a program that could have been written of this section. Make sure that you use plenty of loops and describein detail what they do. Try and use some arrays in this part of the book.
OUTCOME
- Develop a program similar in complexity to the one described in this part of the book
HINT Try and reinforce the students knowledge of loops and arrays, teach them very gentlythe student will only have a brief knowedge of them
PROGRAM Develop a progam similar in complexity to the one that you describe.
CHUNK 36
TITLE Drawing lines 1
DESCRIPTION First describe Processing's line functions. Then describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops
OUTCOMES
- Understand the function of the various line functions detailed in the text.
- Use the various line functions detailed in the text.
HINT This is quite a substantial amount of work. Try and explain any loops in the program you present gently: the reader is still getting used to them.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 37
DESCRIPTION Describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops and some arrays.
OUTCOME
- Use the various line functions detailed in the text.
HINT This is quite a substantial amount of work. Try and explain any loops and arrays in the program you present gently: the reader is still getting used to them.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 38
TITLE Drawing lines 3
DESCRIPTION Describe a simple program of similar complexity to that found in Greenberg 188--189. Employ quite a few loops and some arrays.
OUTCOME
- Use the various line functions detailed in the text.
HINT The previous two chunks of the text will have taught loops and arrays so assume that the reader is happy with these concepts.
PROGRAM Amend the program you present so that it carries out a slighly different funcion.
CHUNK 39
TITLE Two dimensional arrays
DESCRIPTION The reader will be used to single dimensional arrays. Teach them about two-dimensional arrays at this point in the book. Use a simple program to illustrate the use of such arrays.
OUTCOMES
- Understand programming statements that contain two dimensional arrays
- Develop simple programs that contain two dimensional arrays.
HINT Perhaps use a simple shape drawing program that stores x and y coordinates in a two-dimensional array
PROGRAM Develop a progrm similar to the one you describe in the text
CHUNK 40
TITLE Vertex functions
DESCRIPTION Describe the concept of a vertex function and provide a programming example more complex than the one found in Greenberg 211--212.
OUTCOMES
- Understand how to use vertex functions.
- Use vertex functions.
PROGRAM Develop a program similar to the one that you use in the text.
Subscribe to:
Posts (Atom)