3.1: binary

Question 1

binary when a transistor is on

Answer 1

1

Question 2

binary when a transistor is off

Answer 2

0

Question 3

bit

Answer 3

can be a 0 or 1

Question 4

nibble

Answer 4

a group of 4 bits

Question 5

byte

Answer 5

a group of 8 bits
2 nibbles

Question 6

base of denary

Answer 6

10

Question 7

base of binary

Answer 7

2

Question 8

highest value that can be represented by a byte

Answer 8

255

Question 9

unsigned binary numbers

Answer 9

1 byte can represent positive values from 0 to 255

Question 10

signed binary numbers

Answer 10

represents positive and negative values
decreases range of values that can be represented

Question 11

sign and magnitude

Answer 11

assigns the most significant bit as the sign bit
1 represents a negative number
0 represents a positive number
means that only 7 bits are available
largest bit bit that can be represented = 127
values from -127 to 127

Question 12

twos complement

Answer 12

the most significant bit represents -128 instead of 128
largest positive that can be represented is 127
largest negative number that can be represented is -128

Question 13

binary addition

Answer 13

0+0=0
0+1=1
1+1=10
1+1+1=11

Question 14

binary overflow

Answer 14

when there is a 9 bit which doesnt fit in the byte

Question 15

disadvantage of binary overflow

Answer 15

one bit less available

Question 16

arithmetic shift ( left shift)

Answer 16

multiplies by 2
you move all the bits 1 position to the left
as new 0 is shifted in

Question 17

arithmetic shift (right shift)

Answer 17

divides by 2
you move all the bits 1 position to the right
you copy the value of the most significant bit

Question 18

logical shift (left shift)

Answer 18

multiplies by 2
same as arithmetic left shift
you move all the bits 1 position to the left
a new 0 is shifted in

Question 19

logical shift (right shift)

Answer 19

divides by 2
moves all the bits 1 position to the right
0 is always inserted

Question 20

logical shift

Answer 20

used to multiply and divide unsigned binary numbers (positive numbers)

Question 21

arithmetic shift

Answer 21

used to multiply and divide signed binary numbers (positive and negative numbers)

Question 22

hexadecimal advantages

Answer 22

easier to read
can represent the same values effortelessly

Question 23

base of hexadecimal

Answer 23

16

Question 24

how many bits can 1 hexadecimal represent

Answer 24

4 bits
1 nibble

Question 25

how many bytes do 2 hexadecimal represent

Answer 25

1

Question 26

converting binary to hexadecimal

Answer 26

group byte into 2 nibbles
example: 10110101 turns into 1011 and 0101

Question 27

uses of hexadecimal

Answer 27

photoshop to change colour
in computer networks to identify a device

Question 28

denary to hexadecimal

Answer 28

0 = 0
1 = 1
2 = 2
3 = 3
4 = 4
5 = 5
6 = 6
7 = 7
8 = 8
9 = 9
10 = A
11 = B
12 = C
13 = D
14 = E
15 = F