1 Data Representation Flashcards

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

convert binary to denary

A

right to left: each bit is worth 2 times the last bit, add up all the bits with 1’s

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

convert denary to binary

A

continually divide denary number by 2 until you get to 0, and put 1 as the remainder for odd numbers. To get the binary number, read the remainders from bottom to top

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

convert binary to octal (and vice versa)

A

for every 3 bits, right to left: each bit is worth 2 times the last bit, add up all the bits with 1’s, for 3 bits is one bit for octal

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

convert binary to hexadecimal (and vice versa)

A

for every 4 bits, right to left: each bit is worth 2 times the last bit, add up all the bits with 1’s, for 4 bits is one bit for hexadecimal

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

What is hex ABC in octal

A

ABC=5274

A=1010 B=1011 C=1100 ABC=1010 1011 1100 = 5274
5=101 2=010 7=111 4=100

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

Uses of the hexadecimal system (4)

A

error codes
MAC (media access control) addresses
IPv6 addresses
HTML colour codes

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

overflow error definition

A

the result of an equation exceeded the largest possible number which can be stored using a certain number of bits

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

logical shift definition

A

a logical shift moves binary numbers to the left or the the right. Each shift left is equivalent to multiplying the binary number by 2 and each shift to the right is equivalent to dividing the binary number by 2

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

what is two’s complement

A

allows binary representation of negative integers
the most important bit (on the far left) of the number becomes a negative
there must be a one in the MIB

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

what is an ASCII code system

A

American Standard Code for Information Interchange
a character set that consists of 7-bit codes (0-127 in denary)
represents the letters, numbers and characters found on a standard keyboard, together with 32 controd codes

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

sound sampling meaning

A

measuring the amplitude of the sound wave

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

sampling rate meaning

A

the number of samples taken in 1 second or the frequency of sound samples taken
measured in hertz (Hz)

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

sampling resolution meaning

A

the number of bits per sample
also known as the bit depth

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

pixels meaning

A

the smallest element of a bitmap image

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

colour depth meaning

A

the number of bits used to represent each colour for each pixel

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

image resolution meaning

A

the number of pixels that make up an image
for example an image could contain 4096 x 3072

17
Q

bit meaning

A

the basic unit of all computing memory storage terms
the word comes from (B)inary dig(IT)
the smallest unit of memory in a computer

18
Q

what is one byte in bits

A

8 bits

19
Q

order of memory size in denary system

A

1 bit
1 Byte
1 kilobyte
1 megabyte
1 gigabyte
1 terabyte
1 petabyte
1 exabyte

20
Q

order of memory size in binary system

A

1 bit
1 Byte
1 kibibyte
1 mebibyte
1 gibibyte
1 tebibyte
1 pebibyte
1 exbibyte

21
Q

file size of an image formula

A

file size = image resolution (in pixels) x colour depth (in bits)

22
Q

file size of a mono sound file formula

A

file size = sample rate (in Hz) x sample resolution (in bits) x length of sample (in seconds)

23
Q

bandwidth meaning

A

the maximum rate of transfer of data across a network

24
Q

reasons to reduce/compress files

A

to save storage space on hard disk drives/solid state drive
to reduce the time taken to stream a music or video file
to reduce the time taken to upload, download or transfer a file across a network (reduces bandwidth)
to reduce costs. for example, when using cloud storage, the cost is based on the size of the files stored

25
Q

what is lossy file compression

A

the file compression algorithm eliminates unnecessary data from the file
this means the original file cannot be reconstructed once it has been compressed
results in some loss of detail when compared to the original file

26
Q

what might lossy file compression do to an image

A

reduce the resolution
reduce the colour depth

27
Q

what might lossy file compression do to a sound file

A

reduce the sampling rate
reduce the resolution
removal of sounds outside the human ear range
if two sounds are played at the same time, only the louder one can be heard by the ear, so the softer sound is eliminated. this is called perceptual music shaping

28
Q

examples of lossy file compression algorithms

A

MPEG-3 (MP3)
MPEG-4 (MP4)
JPEG

29
Q

what is lossless file compression

A

with this technique, all the data from the original uncompressed file can be reconstructed
none of the original detail from the file is lost

30
Q

what is RLE

A

run length encoding
it is a form of lossless/reversible file compression
reduces the size of a string of adjacent, identical data
a repeated string is encoded into two values:
-the first value represents the number of identical data items in the run
-the second value represents the code of the data item