AQA A-Level Computer Science Paper 2 (Python)

5.0(1)
studied byStudied by 44 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/527

flashcard set

Earn XP

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

528 Terms

1
New cards

Natural Numbers (N)

Positive Integers that are used for counting; N = {0, 1, 2, 3, ...}.

2
New cards

Integer Numbers (Z)

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

3
New cards

Rational Numbers (Q)

Numbers that can be represented as a fraction — e.g. 8/1.

4
New cards

Irrational Numbers

Numbers that cannot be represented as a fraction — e.g. √2.

5
New cards

Real Numbers (R)

A number that a possible real-world quantity and is used for measurement.

6
New cards

Ordinal Numbers

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

7
New cards

Base

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

8
New cards

Base 2 (Binary)

A number system that uses 2 symbols, 0 & 1. Numbers in base 2 are written as X2 such as 112 representing 3.

9
New cards

Binary Representation of Numbers

Uses 2^x to represent numbers, with x increasing by one every place, starting from the rightmost place.

10
New cards

Base 10 (Decimal)

A number system that uses 10 symbols, 0-9. Numbers in base 10 are written as X10 such as 1110 representing 11.

11
New cards

Decimal Representation of Numbers

Uses 10^x to represent numbers, with x increasing by one every place, starting from the rightmost place.

12
New cards

Base 16 (Hexadecimal)

A number system that uses 16 symbols, 0-9 & A-F. Numbers in base 16 are written as X16 such as 1116 representing 17.

13
New cards

Hexadecimal Representation of Numbers

Uses 16^x to represent numbers, with x increasing by one every place, starting from the rightmost place.

14
New cards

Hexadecimal Advantages

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

15
New cards

Decimal to Binary Conversion

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

16
New cards

Decimal to Hex Conversion

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

17
New cards

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.

18
New cards

Bits

The fundamental unit of information, which can either be 0 or 1. 2n values can be represented with n bits.

19
New cards

Bytes

A group of 8 bits.

20
New cards

Kilobyte

kB, 103 bytes.

21
New cards

Megabyte

MB, 106 bytes.

22
New cards

Gigabyte

GB, 109 bytes.

23
New cards

Terabyte

TB, 1012 bytes.

24
New cards

Kibibyte

KiB, 210 bytes.

25
New cards

Mebibyte

MiB, 220 bytes.

26
New cards

Gibibyte

GiB, 230 bytes.

27
New cards

Tebibytes

Tib, 240 bytes.

28
New cards

Signed Binary

A binary item that can hold positive or negative values using two’s complement.

29
New cards

Unsigned Binary

A binary item that does not distinguish between positive and negative numbers. The minimum value for a unsigned binary value is 0, and the maximum value is 2n-1.

30
New cards

Binary Addition: 0 + 0 =

0

31
New cards

Binary Addition: 0 + 1 =

1

32
New cards

Binary Addition: 1 + 1 =

10

33
New cards

Binary Addition: 1 + 1 + 1 =

11

34
New cards

Overflow Error

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

35
New cards

Underflow Error

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

36
New cards

Binary Multiplication: 0 * 0 =

0

37
New cards

Binary Multiplication: 0 * 1 =

0

38
New cards

Binary Multiplication: 1 * 1 =

1

39
New cards

Two's Complement

A way of showing negatives in signed binary. The MSB is always 1 when a binary number is negative (a sign bit). Work out the positive number, switch the 1s and 0s, and add 1.

40
New cards

Two's Complement Range

12710 to -12810

41
New cards

Binary Subtraction

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

42
New cards

Binary Fractions

Bits on the right after a notational point are fractional.

43
New cards

Fixed-Point Binary

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

44
New cards

Fixed Point Binary Advantages

Points close to the MSB allow for good precision, points close to the LSB allow for good range.

45
New cards

Fixed Point Binary Disadvantages

Points close to the MSB produce a smaller range, points close to the LSB produce little precision.

46
New cards

Floating Point Binary

Held in the formant m x 2n where m is the mantissa, and n is the exponent. Convert the number into binary, with the MSB as a sign bit. The amount that the decimal point moves is the exponent.

47
New cards

Floating Point Binary Advantages

A greater range of numbers can be represented with a given number of bits. A large exponent with a small mantissa allows for a large range, a small exponent with a large mantissa allows for good precision.

48
New cards

Floating Point Binary Disadvantages

A large exponent with a small mantissa produces little precision, a small exponent with a large mantissa produces a small range.

49
New cards

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

50
New cards

Rounding Errors

Some numbers, such as 0.110 can only be approximately represented — thus some representations may be inaccurate.

51
New cards

Absolute Error

The difference between the actual number and the nearest representable value.

52
New cards

Relative Error

The absolute error as a percentage of the true value.

53
New cards

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.

54
New cards

Unicode

Introduced to standardise the encoding of characters from all languages.

55
New cards

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.

56
New cards

Transmission Errors Causes

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

57
New cards

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.

58
New cards

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.

59
New cards

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.

60
New cards

Modulus 10

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

61
New cards

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.

62
New cards

Analogue Data

Continuous data that can be any float from 0 to 1.

63
New cards

Analogue Signals

A transmission of a set of analogue data structures, that varies with time, between computation processes.

64
New cards

Digital Data

Discrete data that can be 0 or 1.

65
New cards

Digital Signals

A transmission of a set of digital data structures, that varies with time, between computational processes.

66
New cards

Analogue to Digital Conversion (ADC)

Digitisation uses sampling and quantisation to store and process analogue data.

67
New cards

Sampling

Taking frequent measurements of an analogue signal at uniform time intervals.

68
New cards

Quantisation

Mapping the measured analogue samples to a series of discrete digital values.

69
New cards

Digital to Analogue Conversion (DAC)

Takes a series of binary numbers and produces a continuous analogue signal.

70
New cards

Resolution

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

71
New cards

Colour Depth

The number of bits stored for each pixel.

72
New cards

Bit Depth

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

73
New cards

Image File Size

Pixels * Bit Depth.

74
New cards

Metadata

Data about data.

75
New cards

Metadata Examples

Width, height, colour depth.

76
New cards

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.

77
New cards

Sound File Size

Sample rate * resolution * length (seconds).

78
New cards

Nyquist 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).

79
New cards

Musical Instrument Digital Interface (MIDI)

A protocol for ADC audio transmission to a digital interface used for the majority of electronic musical instruments and computers.

80
New cards

Musical Instrument Digital Interface Advantages

Allows for easy manipulation of music without loss of quality, smaller in size than sampled audio files.

81
New cards

Musical Instrument Digital Interface Disadvantages

Cannot be used for storing speech, sometimes results in a less realistic sound.

82
New cards

Lossy

Non-essential data is permanently removed.

83
New cards

Lossy Qualities

Reduces quality, used for images and sounds.

84
New cards

Lossless Compression

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

85
New cards

Lossless Qualities

Does not reduce quality, used for text files and code.

86
New cards

Run Length Encoding (RLE)

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

87
New cards

Dictionary Compression

Spots regularly occurring data and stores it separately in a dictionary.

88
New cards

Encryption

Using an algorithm and a key to convert message data into a form that is not understandable without that key.

89
New cards

Caesar Cipher

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

90
New cards

Caesar Shift Cipher

Letters are shifted by the same amount alphabetically, and the ‘shift’ becomes the key.

91
New cards

Caesar Substitution Cipher

The letters are randomly replaced.

92
New cards

Caesar Cipher Disadvantages

Can be easily cracked due to the frequency of occurrence.

93
New cards

Vernam Cipher

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

94
New cards

Vernam Cipher Encryption

Aligning the plaintext and the key, converting each character to binary, applying a logical XOR operation, converting the result back into characters.

95
New cards

Computational Security Ciphers

Ciphers that are theoretically crackable, but not within a reasonable timeframe.

96
New cards

Brute Force

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

97
New cards

Algorithmic Security

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

98
New cards

Hardware

The physical components of the computer.

99
New cards

Hardware Examples

Motherboards, hard drives, RAM.

100
New cards

External Hardware

Peripherals that can be added or removed from a computer.