Select a course.
arrow_back
Paper 2 - Computational thinking, algorithms & programming - 2.1 Algorithms
infoWhy this? Abstraction, decomposition, and algorithmic thinking give us a systematic way to turn problems into precise, testable solutions. Representing, tracing, and comparing algorithms, including standard searches and sorts, develops logical reasoning and helps us judge whether a solution is suitable and correct.
scheduleWhy now? Opening with algorithms establishes the problem-solving methods and representations we will use throughout the course. Designing solutions before implementing them provides a clear foundation for the programming fundamentals unit that follows.
neurologyYou need to know
- Understanding of principles of abstraction, decomposition and algorithmic thinking and how they are used to define and refine problems
- How to identify the inputs, processes and outputs for a problem
- How different types of diagram are used to aid design of a solution to a problem
- The symbols used to create flowcharts
- The format of pseudocode/ exam reference language
- The difference between syntax and logic errors
- How trace tables are used
- Understand the main steps of binary and linear search algorithms
- Understand the main steps of bubble; merge and insertion sort algorithms
- Understand any pre-requisites of an algorithm
rocket_launchYou must be able to
- Produce structure diagrams
- Produce flowcharts to solve a range of different problems
- Produce pseudocode/ exam reference language solutions to a range of different problems
- Identify common errors
- Show use of trace tables to identify errors created programs.
- Apply the search and sort algorithm to a data set
- Identify an algorithm if given the code or pseudocode for it
Revision Quiz
trophy
Congratulations! You have completed the quiz.