AQA A-Level Computer Science Paper 2

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions
Get a hint
Hint

Natural Numbers (N)

1 / 407

flashcard set

Earn XP

Description and Tags

All sections of the AQA A Level specification except 4.7.4, 4.8, & 4.11. Will update as these are done in class. Good luck revising :)

408 Terms

1

Natural Numbers (N)

Positive Integers; N = {0, 1, 2, 3, ...}

New cards
2

Integer Numbers (Z)

Whole numbers; Z = {..., -1, 0, 1, ...}

New cards
3

Rational Numbers (Q)

Numbers that can be represented as a fraction (all integers are rational)

New cards
4

Irrational Numbers

Numbers that cannot be represented as a fraction

New cards
5

Real Numbers (R)

A number that exists (so not a conceptual number like Pi)

New cards
6

Ordinal Numbers

The positions used in lists (1, 2, 3, ...)

New cards
7

Base

The number of symbols used to construct values (also referred to as a subscript)

New cards
8

Base 2 (Binary)

A number system that uses 2 symbols, 0 & 1. Numbers in base 2 are written as X(v2) such as 11(v2) representing 3.

New cards
9

Binary Representation of Numbers

Uses 2^x to represent numbers, with x increasing by one every place, starting from the rightmost place. (So 1, 2, 4, 8, 16, 32, 64, 128)

New cards
10

Base 10 (Decimal)

A number system that uses 10 symbols, 0-9. Numbers in base 10 are written as X(v10) such as 11(v10) representing 11.

New cards
11

Decimal Representation of Numbers

Uses 10^x to represent numbers, with x increasing by one every place, starting from the rightmost place. (So 1, 10, 100)

New cards
12

Base 16 (Hexadecimal)

A number system that uses 16 symbols, 0-9 & A-F. Numbers in base 16 are written as X(v16) such as 11(v16) representing 17.

New cards
13

Hexadecimal Representation of Numbers

The Hexadecimal system uses 16^x to represent numbers, with x increasing by one every place, starting from the rightmost place. (So 1, 16, 256)

New cards
14

Hexadecimal Advantages

Easier to read and than binary, and easily converted into both denary and binary.

New cards
15

Decimal to Binary Conversion

From left to right in the place value table, subtract the place value from the decimal number where possible.

New cards
16

Decimal to Hex Conversion

Divide the decimal number by 16, and add the remainder.

New cards
17

Significance of 16

16 is 2^4, meaning that base 16 numbers can be translated from 4 consecutive bits of a binary value. This makes it simple to translate binary numbers into hexadecimal values and back again.

New cards
18

Bits

Each individual digit in a binary digit is referred to as a bit, from the term binary digit

New cards
19

Bytes

A collection of 8 bits

New cards
20

Kilobyte

KB, 10^3 bytes

New cards
21

Megabyte

MB, 10^6 bytes

New cards
22

Gigabyte

GB, 10^9 bytes

New cards
23

Terabyte

TB, 10^12 bytes

New cards
24

Kibibyte

KiB, 2^10 bytes

New cards
25

Mebibyte

MiB, 2^20 bytes

New cards
26

Gibibyte

GiB, 2^30 bytes

New cards
27

Tebibytes

Tib, 2^40 bytes

New cards
28

ASCII Code

In 1963, the American Standard Code for Information Interchange, was established to encode symbols found in the English alphabet. Important ASCII values: A = 65, a = 97

New cards
29

Unicode

Introduced to standardise the encoding of characters from all languages

New cards
30

Transmission errors

When data is transmitted, it doesn't always arrive in the same format that it was sent. These errors cause bits to flip from 1s to 0s and vice versa.

New cards
31

What causes Transmission errors?

Electrical interference, power surges, synchronisation issues, broken cables and connectors

New cards
32

Parity Bits

When sending a byte of data, one bit is used as a parity bit. This bit is set to a 1 or 0 to make the total numbers of 1s or 0s in the byte odd or even depending on the machine. If the wrong number of bits are 'on', an error has occurred.

New cards
33

Majority Voting

Each bit of a message is sent three times- if a bit value is flipped erroneously, the recipient computer uses the majority rule and assumes that two bits that have not changed were therefore correct.

New cards
34

Check Digits

An additional digit at the end of a string of data, designed to check for mistakes in input or transmission. The first 12 digits make up the data, and the 13th is calculated by an algorithm based on the other digits

New cards
35

Modulus 10

Add all the numbers, find the remainder when divided by 10, subtract remainder from 10. Used in check digits

New cards
36

Check Sums

A total sum of all bytes is calculated with an algorithm and sent with the data. When received, it is recalculated and compared to determine if any transmission errors have occurred

New cards
37

Binary Addition: 0 + 0 =

0

New cards
38

Binary Addition: 0 + 1 =

1

New cards
39

Binary Addition: 1 + 1 =

10

New cards
40

Binary Addition: 1 + 1 + 1 =

11

New cards
41

Overflow Error

When the result of an operation is too large for the number of bits the computer works with

New cards
42

Underflow Error

When the result of an operation is too small for the number of bits the computer works with

New cards
43

Binary Multiplication: 0 * 0 =

0

New cards
44

Binary Multiplication: 0 * 1 =

0

New cards
45

Binary Multiplication: 1 * 1 =

1

New cards
46

Two's Complement

A way of showing negatives in binary. The MSB is always 1 when a binary number is negative (a sign bit). After writing the positive version, the complement can be written by starting at the LSB, all bits until and including the first 1 stay the same. From there to the MSB, the numbers are reversed.

New cards
47

Two's Complement Range

127(v10) to -128(v10)

New cards
48

Binary Subtraction

Using two's complement of the second number allows for addition instead

New cards
49

Binary Fractions

Bits on the right after a notational point are fractional

New cards
50

Fixed-Point Binary

Uses a specified number of bits where the placement of the binary point is fixed

New cards
51

Floating Point Numbers

Held in the formant m x 10n where m is the mantissa, and n is the exponent. The MSB is a sign bit for the mantissa and the exponent

New cards
52

Normalisation

The process of moving the binary point of a floating-point number to provide the maximum level of precision for a given number of bits, by ensuring the first digit after a binary point is a significant digit

New cards
53

Relative Error

Calculated as percentage

New cards
54

Analogue Data

Continuous data that can be any float from 0 to 1

New cards
55

Digital Data

Discrete data that can be 0 or 1

New cards
56

Resolution

The number of pixels used the make up a bitmap (width x height)

New cards
57

Bit Depth

The amount of bits used to store information (colour, audio), calculated with 2^bits

New cards
58

Image File Size

Pixels * Bit Depth

New cards
59

Metadata

Data about data

New cards
60

Vector Images

Made up of geometric shapes rather than manipulating individual pixels. The properties of each shape are stored and retrieved in order to mathematically redraw the shape to display it.

New cards
61

Sound File Size

Sample rate * resolution * length (seconds)

New cards
62

Nyguist Theorem

Because sound is made up of many components at different frequencies, samples must be twice the highest frequency in order to replicate the original soundwave (fs > 2fmax)

New cards
63

Lossy

Non-essential data is permanently removed

New cards
64

Lossy Qualities

Reduces quality, used for images and sounds

New cards
65

Lossless Compression

Patterns in the data are spotted and summarised in a shorter format without permanently removing any information

New cards
66

Lossless Qualities

Does not reduce quality, used for text files and code

New cards
67

Run Length Encoding (RLE)

A basic method of compression that summarises consecutive patterns of the same data

New cards
68

Dictionary Compression

Spots regularly occurring data and stores it separately in a dictionary

New cards
69

Encryption

A way of making data unintelligible if the recipient doesn't have the means to decrypt it

New cards
70

Caesar Cipher

A basic an insecure form of encryption, where characters are shifted by a consistent amount

New cards
71

Vernam Cipher

An unbreakable cipher, that is truly random sequence that is equal or longer in length than the plaintext and only ever used once

New cards
72

Brute Force

Attempts to apply every possible key to decrypt ciphertext until it works

New cards
73

Algorithmic Security

Ciphers are based on computational security, with keys determined by an algorithm

New cards
74

Hardware

The physical components of the computer

New cards
75

Hardware Examples

Motherboards, hard drives, RAM

New cards
76

External Hardware

Peripherals that can be added or removed from a computer

New cards
77

External Hardware Examples

Monitors, keyboards, mice

New cards
78

Software

Programs which run on the hardware

New cards
79

System Software

Software required to run and manage the computer's hardware and application programs

New cards
80

System Software Examples

Allocates jobs to the processor, peripheral management, software installation

New cards
81

Operating System (OS)

A middleman for communication between the computer's hardware and software

New cards
82

Operating System Examples

Windows, Mac OS, Linux, Android

New cards
83

Operating System Tasks

Resource management, provision of a UI

New cards
84

Utility Software

Designed to analyse, configure, optimise, or maintain a computer system. Some perform additional common tasks needed by most or all users.

New cards
85

Utility Software Examples

Defragmentation, installation of software, virus checkers, automatic backup

New cards
86

Libraries

A collection of pre-compiled routines that can be used by other programs

New cards
87

Libraries Examples

Random, time, tkinter

New cards
88

Translators

Translates code from high level languages into machine code

New cards
89

Translator Examples

Assemblers, Compilers, Interpreters

New cards
90

Application Software

Allows the user to complete tasks

New cards
91

Application Software Examples

Word Processors, image editors, internet browsers

New cards
92

General Purpose Software

Software that can be used for a range of generic tasks

New cards
93

General Purpose Software Examples

Word processors, graphics packages, spreadsheet software

New cards
94

Special Purpose Software

Software that performs tasks for a single, specific job

New cards
95

Special Purpose Software Examples

Payroll software, Media players, Calendar programs

New cards
96

Off-the-shelf Software

Readily available software that is low cost and well tested

New cards
97

Bespoke Software

More expensive software created to fulfil exact specifications

New cards
98

Memory Management

Allocates memory to each process

New cards
99

Processor Scheduling

Controls which programs can send data to the processor, and queues instructions to create multi-tasking

New cards
100

The Schedular

Ensures that processor time is used as efficiently as possible

New cards
robot