paper 2 - section 7 - data representation Flashcards

1
Q

what are logic gates?

A

special circuits built into computer chips. They receive binary data, apply a boolean operation, then output a binary result

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

how many inputs and outputs do NOT gates have?

A

one of each

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

what do not gates do?

A

the output is always the opposite value to the input. If 1 is input, it outputs 0. If 0 is input, it outputs 1

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

how many inputs and outputs does an AND gate take?

A

it takes 2 inputs and gives 1 output

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

what does an AND gate do?

A

if both inputs are 1, the output is 1, otherwise the output is 0

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

how many inputs and outputs does an OR gate have?

A

2 inputs and 1 output

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

what does an OR gate do?

A

if one or more inputs are 1, then the output is 1, otherwise the output is 0

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

what does a NOT gate look like?

A

a sideways triangle with a small circle at the tip

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

what does the AND gate look like?

A

the letter D

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

what does an OR gate look like?

A

an arrowhead

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

what are two-level logic circuits?

A

logic circuits that require the inputs to pass through a maximum of 2 logic gates to reach the outputs

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

what is the symbol for AND?

A

/\

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

what is the symbol for OR?

A

\/

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

what is the symbol for NOT?

A

¬

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

what is the smallest measure of data?

A

bits

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

what do computers use to represent the flow of electricity?

A

binary

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

does a 1 mean electricity is flowing or isn’t flowing?

A

is flowing

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

does a 0 show that electricity is flowing or that it isn’t flowing?

A

that it isn’t flowing

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

what is a byte big enough to store?

A

one character

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

what is the file size of most files (like songs, pictures and documents) measured in?

A

kB or MB

21
Q

what are high definition videos and complex applications often measured in?

A

gigabytes

22
Q

what is secondary storage capacity measured in?

A

gigabytes or terabytes

23
Q

why is each unit 1024 (not 1000) times bigger than the previous unit?

A

because 1024 is a power of 2 which is helpful when dealing with binary data

24
Q

what is the formula to find out how many different values a data unit can take?

A

2^n where n is the number of bits

25
Q

what are parity bits used for?

A

they’re used to check for errors

26
Q

what are check digits used for?

A

check digits are a way of checking that data has been entered and read correctly. They are digits added to the end of numbers (e.g. ISBNs on books) and are calculated using other digits in the number. If the check digit is correct when data is read, then it’s likely that the data has been entered/read correctly

27
Q

what is the check digit called for binary data?

A

a parity bits

28
Q

what is an even parity bit used for?

A

it is added to make a binary string have an even number of 1s

29
Q

what is an odd parity bit used for?

A

an odd parity bit is added to make a binary string have an odd number of 1s

30
Q

what would the even parity bit of the 7-bit string 1010010 be?

A

1010010 has three 1s, so the even parity bit is 1. This is sent as 10100101

31
Q

what would the even parity bit of the 7-bit string 1100101 be?

A

1100101 has four 1s, so the even parity bit is 0. This is sent as 11001010

32
Q

what would the odd parity bit of the 7-bit string 1010010 be?

A

it has three 1s, so the odd parity bit is 0. This is send as 10100100.

33
Q

what would the odd parity bit of the 7-bit string 1100101 be?

A

it has 4 1s, so the even parity bit is 1. This is sent as 11001011.

34
Q

what is the problem with parity bits?

A

if two bits within the same binary string are read incorrectly then no error will be detected. For example, if an even parity bit is used and the binary string 10100000 is read as 10000100 then no error will be picked up.

35
Q

which denary numbers can 8-bit binary numbers represent?

A

the denary numbers 0 to 255

36
Q

which denary numbers can 16-bit binary numbers represent?

A

the numbers 0 to 65,535

37
Q

which denary numbers can 32-bit binary numbers represent?

A

the numbers 0 to 4,294,967,295

38
Q

when do overflow errors occur?

A

when a calculation gives a result with more bits than are available to store it. This can be a real problem - programmers must make sure that they can’t occur, or that they are dealt with.

39
Q

what is used to show that an overflow error has occured?

A

overflow flags

40
Q

why are overflow errors a problem?

A

they can lead to a loss of data and a loss of accuracy in your answer. It could also cause software to crash if it doesn’t have a way of dealing with the extra bit.

41
Q

what does a binary shift do?

A

it moves every bit in a binary number left or right a certain number of places

42
Q

what is another name for a binary shift?

A

a logical shift

43
Q

what happens to gaps at the beginning or end of the number in a binary shift?

A

the gaps are filled in with 0s

44
Q

what do left shifts (binary shifts) do?

A

multiply a binary number. For every place shifted left, the number is doubled.

45
Q

what do right (binary) shifts do?

A

they divide a binary number. For every place shifted right, the number is halved

46
Q

how many bits is each hex character equal to?

A

4 bits (a nibble)

47
Q

what are the advantages of using hexadecimal?

A
  • it’s simpler to remember large numbers in hex - they’re far shorter than binary numbers
  • due to hex numbers being shorter, there’s less chance of input errors
  • it’s easier to convert between binary and hex than binary and denary
48
Q

what do you do if, when you are converting binary to hexadecimal, you can’t split the binary number evenly into nibbles?

A

you add 0s on the front until there is an exact number of nibbles