1.2.4 data storage Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

binary

A

base 2

range: 00000000 - 11111111

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

denary

A

base 10

range: 0 - 255

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

hexadecimal

A

base 16
this includes: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
range: 00 - FF

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

MSB and LSB

A

most significant bit = bit 7

least significant bit = bit 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

why is hexadecimal used to represent numbers instead of binary?

A

they take up less space and they are easy to spot errors with

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

binary to hex

A

split the 8 digit binary into two nibbles
convert the two nibbles to denary
convert both denary numbers into hexadecimal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

hex to binary

A

split the hex digit into two
convert both hex digits to denary
convert both denary numbers into nibbles
put the two nibbles together to make a byte

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

hex to denary

A

split the two digits
convert each digit into a nibble
put the nibbles together to form a byte
convert the byte to denary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

denary to hex

A

convert denary into binary
split into two nibbles
convert each nibble into hex
put the two digits together

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

overflow errors

A

when adding two binary numbers we can end up with an extra digit that doesn’t fit. this is called an overflow error
this might make the program crash

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

left binary shifts

A

1 shift left = X2
2 shifts left = X4
3 shifts left = X8
you may get overflows with left binary shifts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

right binary shifts

A

1 shift right = ÷2
2 shifts right = ÷4
3 shifts right = ÷8
you may get an underflow with right binary shifts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

characters

A

each character is represented by a unique binary number
a character set is the possible characters that can be represented by a computer system
well known character sets include: ASCII, extended ASCII and Unicode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

ASCII

A

a 7 bit character set with 128 characters
it is stored as a byte (8 bits) but only uses 7 bits
the 8th bit can be used for other sets such as the extended ASCII.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

extended ASCII

A

an 8 bit character set with 256 characters

this is used for languages such as Spanish or French

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

unicode

A

Unicode was developed to code for every language in the world
it uses two bytes which gives us 2^16 character possibilities (65,536)

17
Q

images

A

images can be stored in binary as bitmap or vectors
bitmap pictures: made from coloured squares called pixels
vector pictures: drawn by following a set of mathematical instructions

18
Q

metadata

A

metadata is data about data

It tells us the file type, size, location, date and time etc.

19
Q

bitmap images

A

each pixel of a bitmap is stored in binary
each pixel has a specific colour, represented by a specific code
the number of bits required for each pixel depends on the number of colours required
the number of colours can be calculated as 2^n - where n is the number of bits for each pixel
the number of bits determines the range of colours, known as the colour depth
colour depth is the range of colours available
image size = height X width X colour depth

20
Q

resolution

A

resolution is the number of pixels per image

the greater the colour depth and resolution, the more realistic colours and the larger the file size of the image