Topic 1: Problem solving 2013 specification 2016 specification Subject content: Students should: 1.1 Algorithms 1.1 Algorithms 1.1.1 understand what an algorithm is, 1.1.1 understand what an algorithm is, what algorithms are used for and be able to what algorithms are used for and be able to interpret algorithms (flowcharts, pseudo- interpret algorithms (flowcharts, code, structured English, written written descriptions, program code) descriptions, program code) 1.1.2 be able to create an algorithm to 1.1.2 understand how to create an solve a particular problem, making use of algorithm to solve a particular problem, programming constructs (sequence, making use of programming constructs selection, repetition) and using an (sequence, selection, iteration) and using appropriate notation (flowchart, written appropriate conventions (flowchart, description, program code) written description, draft program code) 1.1.3 be able to describe the purpose of 1.1.3 understand the purpose of a given a given algorithm and explain how a algorithm and how an algorithm works simple algorithm works 1.1.4 be able to identify the correct 1.1.4 understand how to determine the output of an algorithm for a given set of correct output of an algorithm for a given data set of data 1.1.5 be able to identify and correct errors in 1.1.5 understand how to identify and algorithms correct errors in algorithms 1.1.6 be able to code an algorithm into a 1.1.6 understand how to code an algorithm high-level language in a high-level language 1.1.7 understand how the choice of 1.1.7 understand how the choice of algorithm is influenced by the data algorithm is influenced by the data structure and data values that need to be structures and data values that need to be
Topic 1: Problem solving 2013 specification 2016 specification Subject content: Students should: 1.1 Algorithms 1.1.1 understand what an algorithm is, what algorithms are used for and be able to interpret algorithms (flowcharts, structured English, written descriptions, program code) 1.1 Algorithms 1.1.1 understand what an algorithm is, what algorithms are used for and be able to interpret algorithms (flowcharts, pseudo- code, written descriptions, program code) 1.1.2 be able to create an algorithm to solve a particular problem, making use of programming constructs (sequence, selection, repetition) and using an appropriate notation (flowchart, written description, program code) 1.1.2 understand how to create an algorithm to solve a particular problem, making use of programming constructs (sequence, selection, iteration) and using appropriate conventions (flowchart, written description, draft program code) 1.1.3 be able to describe the purpose of a given algorithm and explain how a simple algorithm works 1.1.3 understand the purpose of a given algorithm and how an algorithm works 1.1.4 be able to identify the correct output of an algorithm for a given set of data 1.1.4 understand how to determine the correct output of an algorithm for a given set of data 1.1.5 be able to identify and correct errors in algorithms 1.1.5 understand how to identify and correct errors in algorithms 1.1.6 be able to code an algorithm into a high-level language 1.1.6 understand how to code an algorithm in a high-level language 1.1.7 understand how the choice of algorithm is influenced by the data structure and data values that need to be 1.1.7 understand how the choice of algorithm is influenced by the data structures and data values that need to be
GCSE_Computer_Science_Mapping_Document.docx