comp 3.1 to 3.3

Question 1

algorithm meaning

Answer 1

a sequence of steps that can be followed to complete a task

Question 2

decomposition meaning

Answer 2

breaking a problem into a number of sub-problems

Question 3

abstraction meaning

Answer 3

removing unnecessary detail from a problem

Question 4

decimal

Answer 4

base-10, 0-9

Question 5

binary

Answer 5

base-2, 0-1, binary is easy when representing 2 states

Question 6

hexadecimal

Answer 6

base-16, 0-15
10-15 is A-F
hex numbers can be expressed more compactly than binary

Question 6

number of bits and bytes

Answer 6

1 bit, 1b
1 nibble, 4b
1 byte, 8b
1 byte, 1B
kilo - 1000 bytes
mega - million bytes
giga - billion bytes
tera - trillion bytes
peta - quadrillion bytes

Question 7

binary shifts

Answer 7

left - multiply by 2

right - divide by 2

Question 8

overflow

Question 9

number base

Question 9

purpose of hexadecimal

Question 10

character set

Question 11

data compression

Question 12

need for data compression

Question 13

RLE

Question 14

RLE method

Question 15

bitmap

Question 16

resolution

Question 17

colour depth

Question 18

pixel

Question 19

number of colours potential

Question 20

1 bit colours

Question 20

2 bit colours

Question 21

normal colour depth

Question 22

number of pixels

Question 23

bitmap image file size

Question 24

Huffman encoding

Question 25

method for Huffman

Question 26

nodes

Question 27

sound file size

Question 28

sample length

Question 29

sample resolution

Question 30

sample rate

Question 31

sample rate unit

Question 32

sample rate explanation

Question 33

analogue sound wave

Question 34

typical CD hertz

Question 35

typical CD bit values

Question 36

unicode vs ASCII

Question 37

sound sample

Question 38

why do we compress data

Question 38

how do you turn a picture into a bitmap and vice versa

Question 39

how to convert analogue waves into digital one and vice versa