Why can the same algorithm be coded in Python, C# or VB.NET?

An algorithm describes the logic of a solution rather than the syntax of a language. Any language able to carry out the steps can implement it.

Is a cooking recipe an algorithm?

A recipe is an algorithm because it is a sequence of steps that completes a task. A recipe is not a program, because a person carries it out rather than a computer.

Why must each step of an algorithm be unambiguous?

A step with only one meaning gives the same result whoever follows it. A computer cannot guess what a vague instruction was meant to say.

What is decomposition?

Decomposition is breaking a problem down into smaller sub-problems. Each sub-problem performs one identifiable task and may be broken down further.

AQA GCSE Computer Science 8525

Algorithms

Topic overview Algorithms, decomposition and abstraction Pseudo-code, flowcharts and trace tables Efficiency of algorithms Linear search and binary search Bubble sort and merge sort

Programming

Topic overview Data types Variables, constants and assignment Sequence, selection and iteration Arithmetic, relational and Boolean operators Arrays and records Input, output, string handling and random numbers Subroutines and structured programming Validation, authentication and testing

Data Representation

Topic overview Number bases and why hexadecimal is used Converting between binary, decimal and hexadecimal Units of information: bits, bytes and prefixes Binary addition and binary shifts Character encoding: ASCII and Unicode Pixels, bitmaps and colour depth Bitmap image file size calculations Digital sound: sampling rate and sample resolution Data compression: Huffman coding and run-length encoding

Computer Systems

Topic overview Hardware, software and the operating system Logic gates, truth tables and Boolean expressions Programming languages and translators The CPU and the fetch-execute cycle Types of memory and embedded systems Secondary storage and cloud storage

Computer Networks

Topic overview Network types and topologies Wired and wireless networks Network protocols The TCP/IP model and its layers Network security methods

Cyber Security

Topic overview Cyber security, common threats and penetration testing Social engineering: blagging, phishing and shouldering Malware: viruses, trojans and spyware Methods to detect and prevent cyber security threats

Relational Databases and SQL

Topic overview Relational databases and keys SQL SELECT queries SQL INSERT, UPDATE and DELETE

Ethical, Legal and Environmental Impacts of Digital Technology

Topic overview Ethical issues in digital technology Legal issues, privacy and surveillance Environmental impacts of digital technology

Algorithms

Algorithms, decomposition and abstraction

3 things to know
Paper 1

Overview

What an algorithm is and how it differs from a program, why each step must be unambiguous, decomposition and abstraction with worked examples, and the systematic approach to solving a problem.

What you need to know

Answer each one before you reveal it.

Your recallNot started

Key term

What does a systematic approach to problem solving involve?

Key term

What is an algorithm?

Key term

How is an algorithm different from a computer program?

Questions from this subtopic

Each one with the model answer underneath.

1
What is an algorithm?
Model answer
An algorithm is a precise sequence of instructions for carrying out a task. Each step is clear and the steps run in a fixed order.
2
How is an algorithm different from a computer program?
Model answer
A program is an algorithm turned into code in one particular language. The algorithm is the underlying method and exists independently of any language.
3
Why can the same algorithm be coded in Python, C# or VB.NET?
Model answer
An algorithm describes the logic of a solution rather than the syntax of a language. Any language able to carry out the steps can implement it.
4
Is a cooking recipe an algorithm?
Model answer
A recipe is an algorithm because it is a sequence of steps that completes a task. A recipe is not a program, because a person carries it out rather than a computer.
5
Why must each step of an algorithm be unambiguous?
Model answer
A step with only one meaning gives the same result whoever follows it. A computer cannot guess what a vague instruction was meant to say.
6
What is decomposition?
Model answer
Decomposition is breaking a problem down into smaller sub-problems. Each sub-problem performs one identifiable task and may be broken down further.

See the rest and revise

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book

2Open book

3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Algorithms

Programming

Data Representation

Computer Systems

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

The table one extra row.

gainslosescopies

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AThe algorithm outputs 1.

BThe variable x falls from 5 to 3 to 1.

CThe loop stops because 1 is not greater than 1.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

ASC means sorting from smallest to largest, or A to Z.

TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Algorithms, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Start revising, £5 a month See how the method works

Or £46 a year, about £3.83 a month. Cancel anytime.