Week 2

Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors(ACTDIP029)

An algorithm can be presented in different ways, however the two most common methods are;

•Pseudocode

•Flowchart

Pseudocode is basically a list of step by step instructions, like a recepie.

A flowchart is a more visual method of presenting an algorithm and provides a more visual presentation.

•Start: A start symbol represents the beginning of an algorithm.

•End: An end symbol represents the completion of an algorithm.

•Process: Represents an operation, or a task, to be carried out.

•Decision / Selection: This involves a choice (IF-THEN-ELSE). A decision has one input and two possible outputs. For example, If you want to ride on the front of the rollercoaster, Then go to queue 1 Else go to queue 2.

•Sequence: a set of instructions or actions in order, meaning that each action follows a previous action. For example, Switch alarm clock off, go shower, brush your teeth, put on clothes, eat breakfast, go to school.

•Looping: Also known as Iteration, this involves repeating actions (WHILE). For example, While your age is equal to or greater than 11 or equal to or less than 18, attend secondary school.

•Variable - a method of storing information which can be called upon later within a program.