1.2 Memory and storage Flashcards
1
Q
What are the 3 number systems?
A
- Denary (base 10)
- Binary (base 2)
- Hexadecimal (base 16)
2
Q
Denary
A
- 10 Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9
- Place values are powers of 10 (100s, 10s, 1s)
3
Q
Binary
A
- 2 Digits: 0 and 1
- Place values are powers of 2 (8s, 4s, 2s, 1s)
4
Q
Hexadecimal
A
- 16 Digits - 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F
- Place values powers of 16 (256s, 16s, 1s)
5
Q
Converting binary to denary
A
- Put the number in a binary place value table
- Add up the place values in columns where there’s a 1
6
Q
Converting denary to binary
A
- Draw a binary place value table
- Keep subtracting the biggest place values you can until you’re left with 0
- If you subtracted a place value, put a 1 in that column, otherwise put a 0
7
Q
Converting Hex to Denary
A
- Put the number in a hex place value table
- Convert each value to hex
- Add up the results
8
Q
Converting Denary to Hex
A
- Dividing by 16 to get a quotient and a remainder
- Convert each to hex
- The quotient is the 1st digit and the remainder is the 2nd
9
Q
Converting Binary to Hex
A
- Put the numbers in a table that repeats 8, 4, 2, 1
- If the binary isn’t 8 bits, add 0s to the front so that it can split into nibbles
- For each nibble, add up the place values in columns where there’s a 1, and convert into hex
10
Q
Converting Hex to Binary
A
- Convert each hex digits into a 4-bit binary number
- Put the nibbles together
11
Q
Binary addition
A
- Use column addition
- Follow the 4 rules:
1) 0 + 0 = 0
2) 1 + 0 = 1
3) 1 + 1 = 10 (carry a 1)
4) 1 + 1 + 1 = 11 (carry a 1)
12
Q
Binary shifts
A
- Move every bit left or right a certain number of places
- Gaps at the beginning or end of the number are filled in with 0s
- Left shifts -> Multiplying -> For every place, number is doubled
- Right shifts -> Dividing -> For every place, number is halved
13
Q
Overflow error
A
- When binary arithmetic gives a result that requires more bits than the CPU is expecting
- Can lead to a loss of data or precision
- In binary addition, two 8-bit numbers might add to give a 9-bit number. If the CPU expects an 8-bit answer then bits will be lost
- Left shifts can cause the most significant bits to be lost
- Right shifts can cause the least significant bits to be lost
14
Q
Eight units of data size
A
- Bits (b) -> a single binary digit (1 or 0)
- Nibble -> 4 bits
- Byte (B) -> 8 bits
- Kilobytes (kB) -> 1000 bytes
- Megabyte (MB) -> 1000 Kilobytes
- Gigabyte (GB) -> 1000 Megabytes
- Terabyte (TB) -> 1000 Gigabytes
- Petabyte (PB) -> 1000 Terabytes
15
Q
How does computer store and process data?
A
- Binary
- Use 0s and 1s to represent flow of electricity -> 1 shows electricity is flowing, 0 shows that it isn’t flowing
- Each 1 or 0 in binary data is a bit. The size of the file is the numbers of 0s and 1s that make up its data