Pearson Edexcel GCSE (1CP2) SLR 10 Topic 1 – Algorithms and computational logic

It includes:

• Student Learning Record Workbook (for use by students)
• Student Learning Record Answers (for use by teachers)
• End of Topic test and answers
• Lesson PowerPoint’s for every lesson
• Any associated answers or references sheets for class activities

These resources provide workbook activities for this topic, primarily for revision of programming principles that will have already been taught throughout the course. Use our comprehensive TIME 2 CODE resources for a programming course.

This topic covers:

1.1 Decomposition and abstraction

• 1.1.1 understand the benefit of using decomposition and abstraction to model aspects of the real world and analyse, understand and solve problems.

1.2 Algorithms

• 1.2.1 be able to follow and write algorithms (flowcharts, pseudocode, program code) that use sequence, selection, repetition (count-controlled, condition-controlled) and iteration (over every item in a data structure), and input, processing and output to solve problems.
• 1.2.2 understand the need for and be able to follow and write algorithms that use variables and constants and one- and two-dimensional data structures (strings, records, arrays).
• 1.2.4 be able to determine the correct output of an algorithm for a given set of data and use a trace table to determine what value a variable will hold at a given point in an algorithm.
• 1.2.6 understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work.
• 1.2.7 be able to use logical reasoning and test data to evaluate an algorithm’s fitness for purpose and efficiency (number of compares, number of passes through a loop, use of memory).

1.3 Truth tables

• 1.3.1 be able to apply logical operators (AND, OR, NOT) in truth tables with up to three inputs to solve problems.

6.1 Develop code

• 6.1.1 be able to use decomposition and abstraction to analyse, understand and solve problems.
• 6.1.2 be able to read, write, analyse and refine programs written in a high-level programming language.
• 6.1.3 be able to convert algorithms (flowcharts, pseudocode) into programs.
• 6.1.5 be able to identify, locate and correct program errors (logic, syntax, runtime).
• 6.1.6 be able to use logical reasoning and test data to evaluate a program’s fitness for purpose and efficiency (number of compares, number of passes through a loop, use of
  memory).