Chunks 1 to 10

CHUNK 1
TITLE Intro to Computer Art”
DESCRIPTION Introduce the main concepts of computer art. Include web links to some sites with some stunning examples.
OUTCOME

• Understand the variety of effects that can be achieved using Processing and other technologies such as Flash.

REFERENCE Greenberg 8--23
HINT Don’t write more than 2000 words.
PROGRAM No program needed for this chunk.

CHUNK 2
TITLE Introduction to Java
DESCRIPTION Introduce Java concentrating on its history. Don’t show any programs. Best to describe a very simple program that draws a couple of lines. Remember the reader will not be a programmer.
OUTCOMES

• Understand how Java emerged from the programming language jungle.
• Describe the main features ,e.g. portability, of the language.

REFERENCE Use the web
HINT Don’t clutter the description with code, remember this is an introduction. No more than half a dozen lines.
PROGRAM No program needed for this chunk.

CHUNK 3
TITLE Algorithms 1
DESCRIPTION An introduction to algorithms. Describe an algorithm in everyday terms, for example show how a cooking recipe is a form of algorithm.
OUTCOMES

• Understand that an algorithm is a description of a computer program.
• Write down a simple algorithm which describes an everyday activity.

REFERENCE Greenberg 41
HINT Don’t do looping or conditional statements, leave this to the next two chunks. Keep to an informal style of presentation.
PROGRAM No program needed for this chunk.

CHUNK 4
TITLE Algorithms 2”
DESCRIPTION A continuation of the previous chunk. This time include simple if statements, no loops though.
OUTCOMES

• Understand the flow of control in a simple if statement.
• Understand the flow of control in an if-else statement.
• Develop simple everyday algorithms that use if statements.

REFERENCE None
HINT Keep to an informal style of presentation. Use Java keywords for the if and if-else. Use an example of a nested if towards the end.
PROGRAM No program needed for this chunk.

CHUNK 5
TITLE Algorithms
DESCRIPTION A continuation of the previous chunk. This time include simple while statements.
OUTCOMES

• Understand the flow of control in a while statement.
• Understand the flow of control in a do-while statement.
• Develop simple everyday algorithms that use while statements.
• Develop simple everyday algorithms that use do-while statements.

REFERENCE None
HINT Keep to an informal style of presentation. Use Java keywords for the while and do-while constructs, you can use if statements in your examples.
PROGRAM No program needed for this chunk.

CHUNK 6
TITLE Name =Two simple programs
DESCRIPTION Describe two simple programs that do not use any conditions or looping, for example a program that drew a number of horizontal lines in different colours.
OUTCOMES

• Be able to understand programs made up from the elements described in the two programs.

REFERENCE Greenberg 59--61”
HINT Use the Greenberg reference as an example , introduce comments here.
PROGRAM Develop two programs similar to those described.

CHUNK 7
TITLE Basic types and naming conventions
DESCRIPTION Introduce the types int, float, String and Boolean. Also describe the naming conventions described in Greenberg. Describe literals and teach the student that Java is strongly typed
OUTCOMES

• Understand naming conventions.
• Detect typing errors in a program such as an int being assigned to a string
• Declare variables and set them equal to literals.

REFERENCE Greenberg 63--67
HINT This is a pretty boring section which is quite easy to write. Try and describe a simple program that includes all the stuff in this chunk.
PROGRAM Develop a program similar to the one described.

CHUNK 8
TITLE Big linear program
DESCRIPTION Describe simple assignments such as x = y/12 and x=x+1. Careful teaching needed here. Then describe a program of the same level of complexity as that in Greenberg 68-69 which employs some simple assignments, you may need to describe functions such as fill.
OUTCOME

• Be able to describe the effect of a simple assignment statement.

REFERENCE Greenberg 68--69
HINT Don't make the assignment statements too complex x=x+1 is probably the most complex.
PROGRAM Develop a similar program to the one described.

CHUNK Id= 9
TITLE Operators
DESCRIPTIONThis part of the book should describe arithmetic operators, logical operators and relational operators. This fairly standard Java teaching stuff. Show them in use with a program similar to that found in Greenberg 68-69. Explain carefully what functions do and use functions you employ in your program as teaching.
OUTCOMES

• Be able to evaluate a simple conditional expression using logical relational and arithmetic operators.
• Be able to take an English statement and turn it into a conditional expression using logical, relational and arithmetic operators.
• Be able to detect syntax errors in the above conditional expressions

REFERENCE Greenberg 72--74
HINT Take this quite gently, use a straight line program similar to that found in Greenberg 68-69 to illustrate the ideas.
PROGRAM Develop a simple straight line program similar to the one you use to describe the concepts in this part of the book

CHUNK 10
TITLE Conditional statements
DESCRIPTION For this part of the book we want you to teach conditional statements. Use a program similar to that in Greenbeg 77-78. You will need to do some teaching on the use of functions (chunk 9 does some teaching) such as setup and framerate. Best to do this first before you look at conditionals; however it is up to you. You will also need to do some teaching about brackets in the context of conditional statements
OUTCOMES

• Understand programs similar to that in Greenberg 77--78.
• Write conditional statements similar in complexity to that found in Greenberg 77-78.
• Detect syntax errors in conditional statements

REFERENCE Greenberg 76--81
HINT Although the students will understand what a function is I would still teach them this carefully
PROGRAM Develop a program similar to the one you use in the text.