GCSE COMPUTER SCIENCE

1.1 Computer Architecture

Paper 1: Computer Systems 1.2 Memory
1.3 Storage
1 hour 30 minutes 1.4 Wired and Wireless Networks
Written Exam Paper 1.5 Network Topologies, Protocols & layers
80 marks
1.6 System Security
50% of total GCSE
1.7 Systems Software
1.8 Ethical, Legal, Cultural & Environmental concerns

Paper 2: Computational thinking,

2.1 Algorithms
algorithms and programming
2.2 Programming Techniques
2.3 Producing Robust Programs
1 hour 30 minutes
2.4 Computational Logic
Written Exam Paper
2.5 Translators & Facilitators of Language
80 marks
2.6 Data Representation
50% of total GCSE
 1.1 SYSTEMS ARCHITECTURE
KEY CONCEPTS THE CENTRAL PROCESSING UNIT (CPU)
 Computer systems take input and stored data, process it
using instructions (software) and then output results.
 IOPS Input, Output, Processing & Storage.
 Embedded systems are computers built in to other
devices like washing machines, dedicated to one task.
 Clock speed: each clock tick triggers part of the FDE
cycle. So the number of instructions a processor can do
in a second is roughly equal to the clock speed
 Number of Cores: The more cores a CPU has the more
instructions can be done at once. Faster processing.
 Cache size: A larger cache gives the CPU faster access
to more data Control Unit (CU): Sends Control Signals between the
different internal components

Program counter: holds the memory address for the

instruction of each cycle.

Arithmetic Logic Unit (ALU): does all of the

calculations and logic operations.

Accumulator: holds the result of any calculations in

the ALU.

MAR (Memory Address Register): holds the address

about to be used by the CPU.

MDR (Memory Data Register:) holds the actual data or

instruction being processed by the CPU.

Cache: very fast memory that stores regularly used

data so that the CPU can access it quickly.
 FETCH – DECODE – EXECUTE CYCLE
1.2 MEMORY
CPU fetches andfrom1.3
instruction the RAMSTORAGE
(copies memory address to MAR, copies
instruction to MDR & adds 1 to PC.
RANDOM ACCESS MEMORY (RAM)
CU decodes the instruction from the MDR
STORAGE CAPACITY
 Instruction
RAM is the is executed by
computer’s thememory
main CU that holds the data, Some storage methods such as a HDD or SSD have a
The next instruction is fetched and
programs
The and files while they are being used.
cycle repeats. large capacity (they can store lots of data. Other
 RAM is volatile (power off = the data is lost) devices such as CDs and SD cards have smaller
 The CPU will fetch instructions from the RAM in the fetch capacity. A Kilobyte is 1000 bytes (Used to be 1024
– decode – execute cycle.EXAM QUESTIONS bytes). Measurements of capacity are shown below:
When
 1. the RAM
Explain howiscache
full size,
the computer uses
cores and VIRTUAL MEMORY.
clockspeed It
affect the
uses the secondary
performance storage
of the CPU. as temporary RAM so that the
computer
2. Define can
whatcontinue
is meantrunning (but slowly).
by an embedded system
3. What is the purpose of the ALU?
READofONLY
4. Explain the role MEMORY
the CPU (ROM)(MAR and MDR)
registers
 5.
ROMExplain how the fetch
is non-volatile (datadecode
still execute cycle power
stored after works is off)
 The BIOS (boot up sequence for a PC) is on a ROM chip
 TYPES OF STORAGE
 Secondary Storage: where all data including the programs
are stored when they are not being used.

Storage Key Information

Hard Disk Drive Magnetic, has moving parts, large
(HDD) capacity, lower cost than SSD
EXAM QUESTIONS
Solid State Drive Flash memory, no moving parts, more 1. Explain how the RAM works with the CPU in the
(SSD) robust than HDD, faster and more fetch – decode – execute cycle
expensive than HDD
2. Explain the difference between volatile and non-
Flash memory Eg: USB memory sticks, memory cards.
volatile memory giving an example of each
Optical Storage Eg: CDs, DVDs. Cheap, portable and fairly
robust. 3. Tom is buying a new laptop, he is not sure
Magnetic tape Used for archive storage (back-ups). Very whether to get a magnetic HDD or SSD. Discuss the
large capacity, low cost, slow. benefits and drawbacks of each.
1.4 WIRED AND WIRELESS NETWORKS
Key Terms NETWORK PERFORMANCE
A network is where devices have been connected together so
These factors can impact on network performance:
that they can share data and resources. Networks can be wired
Bandwidth: The more bandwidth, the more data that
(Ethernet / Fibre Optic) or wireless (WiFi).
can be transferred at a time.
Local Area Cover a small geographical area such as an Number of Users: Having a lot of people using a
Network (LAN) office. Use their own infrastructure. network means lots of data is being transmitted
Wide Area WANs connect LANs together over a large which can slow it down.
Network geographical area and make use of Transmission Media: Wired connections are faster
(WAN) infrastructure from telecommunications than wireless. Fibre optic cables are faster than
companies. copper cables.
Bandwidth The amount of data that can pass between
Wireless Factors: wireless can be affected by
network devices per second
Server A device that provides services for other walls, distance, signal quality and interference
devices (e.g. file server or print server) from other devices.
Client A computer or workstation that receives Topology: The layout of a network can impact on its
information from a central server performance.
Peer to peer All of the computers in the network are
 VIRTUAL NETWORKS
Part of a LAN or WAN where only certain devices can
“see” and communicate with each other, they are
controlled with software. On a WAN this is a VPN.
NETWORK HARDWARE
Network Interface Card (NIC): hardware that allows a device to
connect to a network (Where the Ethernet cable plugs in).
EXAM QUESTIONS
Switches: connect devices on a LAN 1. Give 3 items of hardware needed for a network
Router: Transmits the data (packets) between the networks (eg: 2. Explain the difference between a peer-to-peer
the internet and your LAN) network and a client server network.
Wireless Access Point (WAP): a switch that allows devices to 3. The school’s network has become very slow.
connect wirelessly. Explain two different reasons why this might be.
Cables: the cables in a network can be twisted pair cables, 4. Evaluate the benefits of using a wired
coaxial cables or fibre optic cables. connection rather than a wireless one.
1.5 NETWORK TOPOLOGIES, PROTOCOLS AND LAYERS
NETWORK TOPOLOGIES LAYERS
Network protocols are divided into layers so that
A topology is the layout of a network.
protocols with similar functions are grouped
Star: If the central switch fails, the
together.
whole network fails. If one device fails,
the network is fine. Layer 4: Turn data into applications or websites
Application HTTP, FTP, SMTP

Mesh: Where some or all of the Layer 3: Control the flow of data
workstations or other devices are Transport TCP
connected directly to each of other. Most
Direct data packets between networks
are usually connected to the node that Layer 2: Network IP
they exchange the most data with.
Layer 1: Data Sending data over a physical network
Link Ethernet

PROTOCOLS
Network protocols are a set of rules or conventions which PACKET SWITCHING
control the communication between devices on a network  Data is split into packets and numbered in order.
Every device has a MAC address so that it can be identified  Each packet is sent by the current fastest route
 EXAM QUESTIONS
1. Explain why protocols are used
2. Describe how packet switching works
3. Evaluate the benefits and drawbacks of a mesh
network.
4. Draw topologies for bus, ring and star networks.
5. Explain the difference between HTTP and HTTPS
6. Explain the difference between POP3 and IMAP
1.6 SYSTEM SECURITY
TYPES OF ATTACK NETWORK SECURITY KEY TERMS
Malware: malicious software intended to cause harm.
Attack How it works How to prevent it Penetration Testing: Organisations employ
Passive Network traffic is Encryption so that professionals to try and hack their network so that
monitored and then data intercepted data they can find areas of weakness.
is intercepted cannot be understood User Access Levels: Different users have different
Active Someone deliberately A firewall and levels of access to programs, websites and data.
attacks a network with antivirus software Encryption: the process of encoding data in such a
malware (eg: a virus) way that only authorized parties can access it and
Insider Someone with network User access levels to those who are not authorized cannot. It can only be
access abuses this to control how much data decrypted with a key.
steal information people can access. Network Forensics: Data packets are captured as they
Brute Force Trial an error until a Making passwords enter the network and analysed to find out the cause
password is attacked difficult to guess. of a network attack.
Locking accounts after
failed attempts. Virus - attach themselves to files and
lware

Denial of The network is flooded This attack is hard to copy themselves when the user copies
Service with useless data so it prevent but a firewall or opens a file.
 EXAM QUESTIONS
1. Describe what is meant by “Malware”
2. Describe how a brute force attack works and how to
prevent it.
F 3. Explain how to keep a network secure.
4. Evaluate the benefits and drawbacks of a business
using penetration testing

1.7 SYSTEMS SOFTWARE

Utility Software
Utilities are programs that help maintain and configure a program.
Most utility software is installed with the Operating system.

Operating Systems: manages the Defragmentation: As files on HDDs are deleted gaps form and new files
hardware and applications, provides are saved in the gaps and become fragmented. Defragmentation software
interfaces. joins fragmented files back together. Disk reads & writes go quicker.

Device Drivers: communicate with the Back Up Utilities: Schedules and manages back-ups.
peripherals and internal hardware. Full back ups = all data is backed up.
Incremental = only files since the last back up are copied.
User Interface: allows the user to
interact with the device. This can Compression: reduces the size of large files so that they take up less
be a Graphical User Interface (GUI) space. Files then need to be extracted before they are used.
which are visual and easy for
someone to use or a command line Encryption: scrambles the data to protect it so that if someone else
interface where the user needs to gets hold of it they cannot access it.
 Open Source and Proprietary Software
Open Source Proprietary
Allows users access to the code to Usually has to be paid for.
edit/change themselves. Only the compiled code is
Usually free to download. released so it cannot be edited.
Frequently programs do 1 task well May be bigger, with more features
Often online support communities. Can give good customer support.

EXAM QUESTIONS
1. Evaluate the benefits and drawbacks of releasing a piece of software
as open source rather than proprietary.
2. Explain three functions of the operating system in a computer
3. Evaluate the difference between doing an incremental back up and a
1.8 ETHICAL, LEGAL, CULTURAL & ENVIRONMENTAL CONCERNS
full back up.

Ethical Legal
 Ethics is about what is considered right and wrong by  Data Protection Act: controls how personal data is
society. used. e.g. it has to be accurate and up to date, kept
 If a company does not behave in an ethical way it secure, should not be kept longer than needed.
might make their customers lose trust in them.  Freedom of information Act: gives the public the right
 Issues such as cyberbullying, trolling and the use of to see information about public organisations.
social media can raise ethical issues.  Computer Misuse Act: makes it illegal to hack a
 Privacy: Users trust companies to keep their data network or create a virus.
private so companies need to take care of it  Copyright, Designs & Patents Act: protects things you
 Censorship: is when a country or organisation have created from being used without permission
controls what people can access on the internet.  Creative Commons Licence: lets people release their
 Surveillance: surveillance is when someone is work to be used and shared legally and sometimes
monitored using technology. modified.


Stakeholders:
2.1 ALGORITHMS
COMPUTATIONAL THINKING FLOWCHART PSEUDOCODE
IF the Decision = TRUE
Focussing on just the important details THEN:
Abstraction
Abstraction
Focussing on just the important details
of a problem
of a problem Perform Process 1
ELSE
Breaking a problem down into smaller Perform Process 2
Decomposition parts
Breaking
so athat
problem down
it is into to
easier smaller
solve
Decomposition parts so that it is easier to solve ENDIF

Algorithmic creating a step by step solution to a

Algorithmic
thinking creating a step by step solution to a
problem
thinking problem

SEARCHING ALGORITHMS SORTING ALGORITHMS

To find an item in a list, computers need to use Sorting algorithms sort items into an ordered list.
a searching algorithm. A linear search and binary
search are both examples of sorting algorithms. Bubble Sort: Checks the first two items in a list, swaps them if
they are in the wrong order and then moves onto the next two
Linear Search: Checks each item in the list one items and repeats the process. Once it has passed through the
by one until it finds what it is looking for list once it goes through again until none of the items need
+ Simple, list doesn’t need to be ordered swapping. + Simple. – Takes a long time
- Not efficient, takes time with lots of data
Merge Sort: Finds the middle item (n+1)/2 and splits the list in
Binary Search: Finds the middle item in an half. Repeats this step until the list is split into individual
ordered list by doing (n+1)/2. IF the middle item items (sub-lists). It them merges (joins) the sublists in pairs.
is what it is searching for it stops. If not, it Each time the sublists are paired they are sorted into the
compares the item you are searching for to the correct order. + Efficient – Slow
middle item so that it knows whether to look in
the first half or second half of the list. Then Insertion Sort: Looks at the second item in a list and compares
it repeats these steps until the item is found it to the items that are in front of it, then inserts it into the
+ More efficient than a linear search right place. It then moves to the next item in the list and
- Only works on an ordered list, complex to repeats these steps. + Quick for sorting small lists – slow with
program long lists
2.2 PROGRAMMING TECHNIQUES
DATA TYPES OPERATORS

Data Definition Operator/Function Definition

Type Exponentiation Raises a number to a power eg: 2**3 OR 2 ^3 (=2 3)
String Text eg: “Hello” Quotient/DIV Gives the whole number after a division
Integer Whole number eg: 32 Remainder/MOD Gives the remainder part of a division
Float/ Decimal number eg: 1.2 == Is equal to
Real ! or <> Is not equal to
Boolean Two values eg: true or false < Is less than
Character A single character eg: b > Is more than
>= Is more than or equal to
Casting is when you want to change <= Is less than or equal to
between data types. Eg – if you want to
use an integer in a sentence you would
need to convert it to a string. ARRAYS

One-Dimensional Arrays- this is like a list. array students [3]

VARIABLES AND CONSTANTS In this example an array has been created called students [0] = “Bob”
students. The list can hold 3 items (as shown). students [1] = “Dave”
Variable – A value which may change students [2] = “Bob”
while the program is running. Variables This command would print the second item (1)
can be local or global. From the array. It would print “Dave”. print(students[1])

Local Variable – a variable which can

only be used within the structure they Two-Dimensional Arrays – these are lists within lists (like a table)
are declared in.
Grades=[[“Bob”, “22%”, “44%”], [“Dave”, 0 1 2
Global Variable – a variable which can “85%”, “100%”]]
be used in any part of the code after 0 Bob 22 44%
they are declared The code above creates the 2D array. The code %
Below would output:
Constant – A value which cannot be “Bob’s first test score was 22%” 1 Dave 85 100
altered as the program is running. % %
print(“Bob’s first test score was “ + Grades [0, 1]
2.2 PROGRAMMING TECHNIQUES CONTINUED
PROGRAMMING CONSTRUCTS STRING MANIPULATION
A Sequence is when there are 0 1 2 3 The characters in a string are numbered starting
programming steps that are W o r d with position 0.
carried out one after another.
Function Purpose
Selection is where there are x.length Gives the length of the string
different paths in your code x.upper Changes the characters in the string to upper case
eg: IF, ELIF, ELSE x.lower Changes the characters in the string to lower case
x[i] Gives the character in position i. Eg: x[2] = “r”
Iteration is when there is x.substring(a,b Gives the characters from position a with length b.
repetition (loops) in code. ) Eg: x.subString(1,2) = or
This could be a WHILE loop (do + Joins (concatenates) two strings together
something WHILE a condition is
met) or a FOR loop (do
something for a set number of FILE HANDLING
times)
Myfile=openRead(“myfile.text”) Opens the file in read mode
This count-controlled loop would print Myfile=openWrite(“myfile.text”) Opens the file in write mode
“Hello World” 8 times.: Myfile.writeLine (“Hello”) Writes a line to the file
for i=0 to 7 Line1=myfile.readLine() Reads one line of the file
print (“Hello”) Myfile.close() Closes the file
next i endOfFile() Used to determined the end of a file

These condition controlled loops would IF/ELSE AND SWITCH/CASE FOR SELECTION
check if a password’s correct:
Selection can be shown using IF/ELSE or SWITCH/CASE
while answer != “letmein123” IF ELSE SWITCH/CASE
answer=input(“Enter password”) if choice == “a” then switch entry:
endwhile print(“You chose A”) case “A”:
elseif choice==“b” then print(“You chose A”)
print(“You chose B”) case “B”:
do else print(“You chose B”)
answer=input(“Enter password”) print(“Unrecognised choice”) default:
until answer==“letmein123” print(“Unrecognised choice”)
2.2 PROGRAMMING TECHNIQUES CONTINUED
SUB PROGRAMS RECORDS
Procedures are a set of instructions stored under a name so that you
Records are a data structure used to store
can call the procedure to run the whole set of instructions.
a collection of data. They can store
A function is a sub program that returns a value to the program.
information of different data types.
Parameters are variables passed into a function or procedure. An
Field = each item in a record is a field.
Argument is the name given to the values passed as parameters.
Each field has a name and data type.
A procedure with parameters A procedure without parameters
procedure intro (name) procedure intro () A record can be created like this:
print(“Hello ” + name) print(“Hello”)
print(“Welcome to the game”) print(“Welcome to the game”) record students
endprocedure endprocedure int student_number
A function with parameters A function without parameters string student_name
function double(number) function getTime() bool passed_test
return number*3 return time from hardware endrecord
endfunction endfunction
Data can be assigned using variables:

SQL (Structured Query Language) Student1=students(1,”Bob Jones”, True)

Student2=students(2,”Steve Smith”, False)
SQL is the language used to manage and search databases. Student3=students(3,”Sally Roberts”, True)
Commands Example What it does
SELECT SELECT name, age Displays the name and age of The whole record can be accessed using the
FROM FROM students everyone in the students table variable name:
WHERE SELECT name FROM students Displays the name of everyone in
WHERE gender=male the students table who’s gender print(Student1)
is male
LIKE SELECT name FROM students Displays the students names that (1, “Bob Jones”, True)
WHERE name LIKE “% Smith” end with Smith.
AND SELECT name FROM students Displays the students who are or part of a record can be accessed:
WHERE gender=male AND male and have an attendance of
attendance > 90 more than 90. print(Student3.student_name)
* SELECT * from students Selects all of the fields from
the students table Sally Roberts
2.3 PRODUCING ROBUST PROGRAMS
DEFENSIVE DESIGN TESTING
Programmers try to protect their programs by testing them to A program should be regularly tested to check for
reduce the number of errors, predicting how users might misuse any errors.
their program and trying to prevent it and making sure their
code is maintainable (easy for others to understand and fix). Iterative testing - a program is tested and then
changes are made as it goes through the
Input Sanitisation – removes any unwanted characters that have development cycle again. It may go through this
been entered into a program process a many times to make sure it is exactly
what the customer wants.
Input Validation – Checks if the data meets certain criteria
before passing it through the program. The following validation Final Testing – The program goes is tested once at
checks can be used: the end of development. Everything is tested in
one go.
Presence check Checks that data has been entered
Length check Checks the data is the correct length Test data can fit into different categories:
Range check Checks the data is within a set range Normal/ Data which is likely to be entered
Format check Checks it’s the correct format e.g. dd/mm/yyyy Valid and should be accepted
Check digit Checks numerical data is entered correctly Invalid Data which is similar to Normal but
Look-up table Checks against a table of accepted values should not be accepted
Extreme/ Data on either side of what should
Authentication – Where a program confirms the identity of a boundary be accepted
user before giving them authorisation. This could be done Erroneous Data that should not be accepted
through usernames and passwords.
TYPES OF ERROR
Authorisation – Where a program checks the user is allowed to
perform a certain task, before letting them do it. Syntax Error – something which doesn’t fit the
rules or grammar of the programming language.
Maintainability – Maintainable code is easy to change. It will Logic Error – the program runs but not as
have comments to help other programmers understand the code, as expected. e.g.: < user instead of >.
well as appropriate names for variables and sub programs, and Runtime errors – often predictable but not certain
indentation so that it is easy for programmers to see the flow to happen errors. e.g. running out of memory,
of the program. Global variables will be avoided so that they faulty or slow input devices, or trying to divide
don’t impact on the rest of the code. by zero.
2.4 COMPUTATIONAL LOGIC
NOT GATE AND GATE OR GATE
A NOT gate takes an input and For an AND gate to give an output of For an OR gate to give an output of 1,
outputs the opposite. 1, both inputs must be 1. either inputs must be 1.

Input A Input B Output Input A Input B Output

0 0 0 0 0 0
Input Output 1 0 0 1 0 1
0 1 0 1 0 0 1 1
1 0 1 1 1 1 1 1

COMBINED GATES LOGIC EXPRESSIONS WHY COMPUTERS USE BINARY

Logic gates can be combined: The table below shows the Computers use 1s and 0s to represent the
logic gate expressions and flow of electricity in their circuits.
notations that you need to
A
know: 0 = off
C P
1 = on
B
Bit = a single bit (0 or 1)
Nibble = 4 bits
A B C P Byte = 8 bits
0 1 0 1 Kilobyte = 1000 bytes
1 0 0 1 Megabyte = 1000 kilobytes
1 1 1 0 Gigabyte = 1000 megabytes
0 0 0 1 Terabyte = 1000 gigabyte
Petabyte = 1000 terabytes
2.5 TRANSLATORS AND FACILITIES OF LANGUAGES
HIGH LEVEL LANGUAGES LOW LEVEL LANGUAGES
 Eg: Python, C, C#, Java, JavaScript etc  Eg: Machine code (binary) and assembly language
 Each instruction in a high level code represents  Each instruction only represents one instruction
many machine code instructions. of machine code
 The code will work on many different computers and  Low level languages are written for one particular
processors machine or processor
 Data can be stored in different structures like  To store data the programmer needs to understand
lists and arrays how the CPU manages memory
 The code is easy to read and understand  Low level code is difficult to read and understand
 The code has to be converted into machine code for  Machine code can be executed without translators
the computer to understand it  Programs are more memory efficient as you control
 Programs will be less memory efficient as there is what the CPU does
no control over what the CPU does

TRANSLATORS IDEs (INTEGRATED DEVELOPMENT ENVIRONMENT)

High level languages have to be translated to machine IDE’s help programmers develop their code. They have a
code for the computer to understand them. range of features to do this:

Assemblers – turn assembly language into machine code Editors – the area which the code is written in.
Includes line numbers and colour coding for different
Compilers – Translate all of the code in one go to create features of the code (variables, comments etc)
an executable file. A compiler can take a long time but
the final code runs quickly. Compilers can give a list of Run Time Environment – Lets the programmer run the code
errors for the entire program if it can’t compile. quickly to test it for errors

Interpreters – Translates the code one instruction at a Error Diagnostics – includes diagnostic tools to help
time as the program is running. This means the program find and solve errors
will run more slowly. No executable file is created so
the code will need to be translated every time it runs. A Translator – to translate the code into machine code
The interpreter will stop after each error which is
helpful when debugging. Breakpoints – Stop the program on certain lines so that
information up to that point can be gathered.
2.6 DATA REPRESENTATION
DENARY BINARY ADDITION
Denary is the decimal number system that we are used to. It
1 0 0 1 0 1 0 1 This binary addition
uses the numbers 0-9 and the column headings go up in powers
of 10. + 1 1 0 1 1 0 1 1 gives an overflow error
1 0 1 1 1 0 0 0 0 as the total does not fit
100 (Hundreds) 10 (Tens) 1 (Units) in 8 bits (a byte).
2 3 8 1 1 1 1 1 1
2 lots of 100 3 lots of 10 8 lots of 1

BINARY SHIFT
BINARY
A binary shift to the left multiplies the number by
Binary uses the numbers 0 and 2. The column headings go up in 2. A binary shift to the right divides it by 2.
power of 2: Below is an 8 bit binary number which has been
128 64 32 16 8 4 2 1 shifted 2 places to the right.
Original number 1 1 0 0 1 1 0 1
0 1 0 0 0 1 1 1
Shifted number 0 0 1 1 0 0 1 1
64 + 4 + 2 + 1 = 71

CHARACTERS
HEXADECIMAL
Character sets = the characters and the numbers that
Hexadecimal uses 0- F (A=10, B=11, C=12, D=13, E=14, F=15).
represent them.
The headings go up in powers of 16.
16 1 ASCII = Each character is represented by a 7 bit
3 D number (often with a 0 in front to make a byte).
3 lots of 16 D (13) lots of 1
Extended ASCII = Each character is represented by an
To convert a binary number to Hexadecimal, split into 2: 8 bit binary number. This gives 256 different
128 64 32 16 possibilities.
1 1 0 0 3* 16 = 48
D (13) * 1 = 13 Unicode = Each letter is represented by a 16-bit or
48+13=61 32-bit binary number. This gives at least twice as
8 4 2 1
many character options as ASCII and allows the
1 1 0 0 character set to represent characters and symbols
= C = 7 from all languages.
2.6 DATA REPRESENTATION CONTINUED
IMAGES SOUND
Bitmap Images are made up of pixels (Picture Elements/dots) When sound is recorded it is an analogue signal
The colour of each pixel is represented by a binary number (waves). It has to be converted to a digital signal so
If an image uses 1 bit to represent each colour then it will that it can be stored by a computer. This is done by
only have 2 colours: sampling

0 0 1 0 0 This is a 1-bit image Sampling: The amplitude of the wave is measured at

0 0 0 1 0 regular intervals which creates a digital
so it uses 2 colours.
1 1 1 1 1 representation of the wave. If samples are taken more
0 0 0 1 0 0=white and 1=black frequently then you will end up with a more accurate
0 0 1 0 0 sound file but it will be a larger file size.
The analogue wave is smoother
Using more bits allows for more colour options: and shows continuous data. The
10 11 00 11 10 digital sampling shows the
This is a 2-bit images
11 11 00 11 11 amplitude of the wave at
so it uses 4 colours.
00 00 01 00 00 different points.
11 11 00 11 11 00=white, 01=blue,
10 11 00 11 10 10=red, 11=black
COMPRESSION
Colour depth = the number of bits used for each pixel
Data compression is the process of encoding data so
Resolution = how many pixels are in a certain space – this is that is needs fewer bits/bytes to represent it.
measured in “dots per inch”. If there are more dots per inch Compression is useful because it helps reduce the
then there are more pixels in the image so it will have a consumption of expensive resources, such as hard disk
higher resolution and a better picture quality. space or transmission bandwidth over the internet.
Lossy Compression: permanently removes some of the
The higher the resolution or the colour depth, the more bits data from a file to make the file size smaller. The
used, so the bigger the file size. file – eg: an image or sound track – will be a lower
quality than the original.
Metadata = the information about the image file that is Lossless Compression: compressing data without losing
stored within it. This makes sure the file is displayed any information, it is reversible so all the original
correctly. It can include: the height, width, colour depth, data can be reconstructed. Good for program files or
resolution and file format as well as the time and date that documents where you do not want to lose any content
the image was created. but files can only be made a little bit smaller.