Australian Digital Technologies Curriculum:AlgorithmsThe precise sequence of steps and decisions needed to solve a problem. They often involve iterative (repeated) processes. 


Algorithms 

F2 Unpack >  34 Unpack >  56 Unpack >  78 Unpack >  910 Unpack >  
Follow, describe and represent a sequence of steps and decisions (algorithms) needed to solve simple problems (ACTDIP004) Follow, describe and represent a sequence of steps and decisions (algorithms) needed to solve simple problems (ACTDIP004) Follow, describe and represent a sequence of steps and decisions (algorithms) needed to solve simple problems (ACTDIP004) Follow, describe and represent a sequence of steps and decisions (algorithms) needed to solve simple problems (ACTDIP004) Follow, describe and represent a sequence of steps and decisions (algorithms) needed to solve simple problems (ACTDIP004) 
Define simple problems, and describe and follow a sequence of steps and decisions (algorithms) needed to solve them (ACTDIP010) Define simple problems, and describe and follow a sequence of steps and decisions (algorithms) needed to solve them (ACTDIP010) Define simple problems, and describe and follow a sequence of steps and decisions (algorithms) needed to solve them (ACTDIP010) Define simple problems, and describe and follow a sequence of steps and decisions (algorithms) needed to solve them (ACTDIP010) Define simple problems, and describe and follow a sequence of steps and decisions (algorithms) needed to solve them (ACTDIP010) 
Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) Design, modify and follow simple algorithms involving sequences of steps, branching, and iteration (repetition) (ACTDIP019) 
Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors (ACTDIP029) Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors (ACTDIP029) Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors (ACTDIP029) Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors (ACTDIP029) Design algorithms represented diagrammatically and in English, and trace algorithms to predict output for a given input and to identify errors (ACTDIP029) 
Design algorithms represented diagrammatically and in structured English and validate algorithms and programs through tracing and test cases (ACTDIP040) Design algorithms represented diagrammatically and in structured English and validate algorithms and programs through tracing and test cases (ACTDIP040) Design algorithms represented diagrammatically and in structured English and validate algorithms and programs through tracing and test cases (ACTDIP040) Design algorithms represented diagrammatically and in structured English and validate algorithms and programs through tracing and test cases (ACTDIP040) Design algorithms represented diagrammatically and in structured English and validate algorithms and programs through tracing and test cases (ACTDIP040) 

