Any positive or negative whole number: Z \= {...-2,-1,0,1,2...}
3
New cards
Rational Numbers
Includes values that can be represented as fractions or decimals: Q \= {...2/1,2/2,2/3...} Q \= {...2,1,0.5,0.25,0.125...}
4
New cards
Real Numbers
Any number that is a natural, integer or rational number
5
New cards
Ordinal Number
Numbers that are used to describe the position in which they appear:
Adam, Belinda, Kyle, Tyler Adam \= 1st, Tyler \= 4th
6
New cards
Binary Number System
Uses the digits 0 and 1 Base 2
7
New cards
Decimal Number System
Uses the digits 0-9 Base 10
8
New cards
Hexadecimal Number System
Consists of 16 distinct symbols — 0-9 and A-F Base 16
9
New cards
Advantages of Hexadecimal
- Easier to remember and write compared to binary - Less chance of errors - Easy to convert into binary
10
New cards
What do we use Hexadecimal for?
- MAC address - Define Colours - Machine Code - Assembly Language
11
New cards
Unsigned Integer
A data type that stores positive integer values as ordinary binary numbers; its value is always assumed to be positive.
12
New cards
Binary multiplication
0x0\=0 0x1\=0 1x0\=0 1x1\=1
13
New cards
Two's Complement
A method of representing negative numbers in the binary system. Found by flipping the postive binary representation of the number, flipping all the bits and adding one.
14
New cards
2 bits
4 values
15
New cards
3 bits
8 values
16
New cards
4 bits
16 values
17
New cards
5 bits
32 values
18
New cards
6 bits
64 values
19
New cards
7 bits
128 values
20
New cards
8 bits
256 values
21
New cards
KB Storage
10^3 \= 1,000
22
New cards
MB Storage
10^6 \= 1,000,000
23
New cards
GB Storage
10^9 \= 1,000,000,000
24
New cards
TB Storage
10^12 \= 1,000,000,000,000
25
New cards
KiB Storage
2^10 \= 1,024
26
New cards
MiB Storage
2^20 \= 1,048,576
27
New cards
GiB Storage
2^30 \= 1,073,741,824
28
New cards
TiB Storage
2^40 \= 1,099,511,627,776
29
New cards
Floating Point Numbers
Numbers where the decimal point can float because there is no fixed number of digits before and after the decimal point.
30
New cards
Mantissa
The bits used to represent the actual number
31
New cards
Exponent
Number that dictates the position of the floating point
32
New cards
Fixed Point Binary
In what representation of binary is the decimal point kept in the same position.
33
New cards
Rounding Errors
The precision of an arithmetic operation is greater than that of the floating-point number format, you can only get so close to representing true value
34
New cards
Absolute Error
The difference between the actual number and the nearest representable value.
35
New cards
Relative Error
The ratio of absolute error to actual measure.
36
New cards
Precision
how close a group of measurements are to each other
37
New cards
Normalization
Moving the binary point of a floating point number to provide the maximum level of precision for a given number of bits Positive Value: 01 Negative Value: 10
38
New cards
Underflow
The result of a calculation is too small to be represented using the available number of bits.
39
New cards
Overflow
The result of a calculation is too large to be represented using the available number of bits.
40
New cards
Transmission Errors
Errors caused by external or internal factors that cause data to arrive in a different form to how it was originally sent.
41
New cards
Parity Bit
A binary digit appended to a group of binary digits to make the sum of all the digits, including the appended binary digit, either odd or even as established beforehand.
42
New cards
Even Parity
The number of 1s in the sequence add up to an even number.
43
New cards
Odd Parity
The number of 1s in the sequence add up to an odd number.
44
New cards
Majority Voting
Each bit is sent three times, and the receiving computer infers the data from what the majority of bits in the bit transmission show.
45
New cards
Problem With Majority Voting
If the majority of the sent bits are errors, the computer will idenfity the error bit as the correct one.
46
New cards
Checksums
An error detection method using an algorithm to calculate the sum of bytes in a transmission, and this calculated sum is also sent with the transmission. The receiving computer recalculates the sum with the transmission it received, and if the values of the sums don't match with the one appended to the transmission, an error has occured or data has been altered.
47
New cards
Character
Letter, number, symbol or control (e.g. spacebar)
48
New cards
Character Code
A binary representation of a particular letter, number or special character.
49
New cards
ASCII
American Standard Code for Information Interchange
50
New cards
How ASCII uses binary
Each character has its own binary representation, 7 Bit Character set, can represent 0-127 (128) characters
51
New cards
Unicode
A character code that enables most of the languages of the world to be symbolized with a special character identification. Can use 16 or 32 bits
52
New cards
Benefits of Unicode
- Can represent characters from different languages - Can represent a lot more characters
53
New cards
16 Bits
65536 Values
54
New cards
24 Bits
16777216 Values
55
New cards
Digital Data
Data that changes discreetly through a finite set of possible values, patterns of 1s and 0s Breaks analogue signal down into pieces and represents them through binary
56
New cards
Pixels
small squares that combine to create an image on a computer monitor. (picture elements)
57
New cards
Analogue to Digital Converter
Device that changes analogue data to digital data so that it can be stored on a computer system. e.g. microphone
58
New cards
Digital To Analogue Converter
A device used to convert digital signals into analogue signals (so the computer can control another device such as a pump, motor, etc.).
59
New cards
Bitmap Resolution
The number of pixels used to make up a bitmap image (Width x Height)
60
New cards
Megapixel
One million pixels, used in reference to the resolution of a graphics device
61
New cards
Image file size
The total number of binary digits in an image. The formula to calculate this is height (px) x width (px) x colour depth.
62
New cards
More Bits Means...
More colors that can be represented
63
New cards
How does Bit depth affect file size
Larger bit depth \= large file size
64
New cards
Bit Depth
Color depth, the number of bits devoted to each pixel in a color display.
65
New cards
Units of computer storage and memory
Bit Nibble Byte Kilobyte Megabyte Gigabyte Terabyte
66
New cards
Metadata
Data about data e.g. Date it was created, colour depth, geolocation, width and height in pixels
67
New cards
Analogue Data
Continuous Representation, is the actual information being represented
68
New cards
Analogue to Digital Conversion Process
- Sound signals recorded via amplifier - Each sample is quantised to measure its wave height and translate this into an integer value - integer value is converted and stored digitally as binary
69
New cards
Sample Resolution
Number of bits used to record each measurement
70
New cards
Resolution Decrease
Quality of sound decreases
71
New cards
Sample Rate
the number of samples taken per second, often measured in Kilohertz (kHz)
72
New cards
Sample Rate Increase
More accurate representation of the sound is created
73
New cards
Sound file size
Sample Rate x resolution x length in seconds
74
New cards
Nyquist Theorem
Samples should be at least double the highest frequency to replicate the original sound wave
75
New cards
Human Hearing Range
20-22,000 Hz
76
New cards
Lossy Compression
Non essential data is permanently removed e.g. different shades of the same colour or sound outside human hearing range
77
New cards
Lossless Compression
Patterns in data are spotted and summarized in a short format without permanently removing them
78
New cards
Run Length Encoding (RLE)
Lossless data compression that summarizes consecutive patterns of the same data, works well with images that have long runs of the same value
79
New cards
RLE of sound
Records one example of the sample and how many times it consecutively repeats
80
New cards
Dictionary Compression
Spots regularly occurring data and stores it separately in a dictionary
81
New cards
MIDI (Musical Instrument Digital Interface)
A set of standards that are used to represent music in digital form.
82
New cards
Encryption
Process of converting readable data into unreadable characters to prevent unauthorized access.
83
New cards
Plaintext
Normal text that has not been encrypted
84
New cards
Caesar Cipher
An algorithm that substitutes each letter in the plaintext with a letter a certain number of steps down the alphabet
85
New cards
Vernam Cipher
A method of encryption that uses a one-time pad (key) to create ciphertext that is mathematically impossible to decrypt without the key. Encryption and decryption of a message is peformed bit by bit using an XOR operation with the one-time pad (key).
86
New cards
One-Time Pad
A truly random sequence used to encrypt and decrypt data. It is only to be used once, and cannot be generated from computers, as they are not truly random. Sources include: - Atmospheric Noise - Radioactive Decay - Movement Of Animals - Snapshots Of A Lava Lamp