Scribd
Upload
24 views4 pages

AQA GCSE Computer Science - Paper 1 Revision Sheet

This revision sheet covers essential concepts for AQA GCSE Computer Science Paper 1, including Python basics such as input/output, variables, and data types. It also explains control structures like arithmetic and comparison operators, selection statements, and loops, alongside algorithm theories like linear and binary search, bubble sort, and merge sort. Additionally, it introduces key algorithm concepts such as decomposition, abstraction, iteration, selection, efficiency, and correctness.

Uploaded by

Smera Sragvi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views4 pages

AQA GCSE Computer Science - Paper 1 Revision Sheet

This revision sheet covers essential concepts for AQA GCSE Computer Science Paper 1, including Python basics such as input/output, variables, and data types. It also explains control structures like arithmetic and comparison operators, selection statements, and loops, alongside algorithm theories like linear and binary search, bubble sort, and merge sort. Additionally, it introduces key algorithm concepts such as decomposition, abstraction, iteration, selection, efficiency, and correctness.

Uploaded by

Smera Sragvi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

AQA GCSE Computer Science - Paper 1

Revision Sheet
1. Python: Core Concepts
Input / Output

input() is used to get input from the user.


print() is used to display output.

Variables

Store values that can change during the program.


Use meaningful names (e.g. score, name).

Data Types

Type Example Description

int 7 Whole numbers

float 3.14 Decimal numbers

str "Hello" Text

bool True True/False values

list [1, 2, 3] Collection of values

2. Control Structures
Arithmetic Operators
Operator Description

+ Addition

- Subtraction

* Multiplication

/ Division

// Floor Division

% Modulus (remainder)

** Exponentiation

Comparison Operators

Operator Meaning

== Equal to

!= Not equal to

> Greater than

< Less than

>= Greater or equal

<= Less or equal

Selection (IF)
if x > 10:
print("High")
else:
print("Low")

Loops
for loop: Known number of repetitions
while loop: Repeats until a condition is false

Algorithm Theory – Exam Focus


Linear Search

Definition: Checks each item in a list one-by-one until the target is found or the end is
reached.
Use: Works with unsorted data.
Efficiency: Simple but inefficient for large lists – time complexity O(n).
Exam Tip: You may be asked to identify when it’s appropriate or count comparisons.

Binary Search

Definition: Repeatedly divides a sorted list in half to find a target value.


Use: Only works on sorted lists.
Efficiency: Much faster than linear search – time complexity O(log n).
Exam Tip: Know how it halves the list and how many steps it takes (log₂n comparisons).

Bubble Sort

Definition: Compares each pair of adjacent items and swaps them if they are in the wrong
order. Repeats until sorted.
Use: Good for small lists, not efficient for large data sets.
Efficiency: Time complexity O(n²) in worst case.
Exam Tip: You may be asked to complete a pass or count swaps/comparisons.

Merge Sort

Definition: A divide and conquer algorithm that splits the list into halves, sorts each half,
and merges them.
Use: Very efficient on large datasets.
Efficiency: Time complexity O(n log n).
Exam Tip: You may be asked to explain the splitting/merging process or compare merge
sort to bubble sort.

4. Flowcharts – Key Symbols


Symbol Purpose

⬛⬛ Terminator Start / End

🔷 Process Instruction

🔶 Decision IF condition

🟥 Input/Output Get or display

➡ Arrow Flow of control

🧪 5. Key Algorithm Concepts


Decomposition: Breaking down a problem into smaller tasks.
Abstraction: Removing unnecessary detail to focus on what’s important.
Iteration: Repeating steps (e.g. loops).
Selection: Choosing between options (e.g. if/else).
Efficiency: How fast or memory-friendly an algorithm is.
Correctness: Whether it produces the right result.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy