3.3 Data Representation Flashcards

1
Q

Pixel

A

The smallest element of a bitmap image that is only one colour.

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

VDU

A

Visual display unit.
Monitor
Computer

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

Resolution

A

The number of bits per area of an image.

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

Pixilation

A

Occurs when the image is overstretched and the image will have a blocky and blurred appearance. This arises when the image is presented as too large a size and there are not enough pixels to reproduce the details in the image at this larger size.

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

Bitmap size

A

Width in pixels X Height in pixels

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

Colour depth

A

The number of bits used to indicate the colour of a single pixel.

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

Bitmap file size

A

Width X Height X Colour depth

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

Metadata

A

Metadata is data about data.
• File type
• Data created
• Height and width
• Resolution
• Colour depth

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

What is sound?

A

Sound is analogue, this means it takes the form of a continuous wave that changes smoothly.

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

Amplitude

A

How loud the sound is

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

Frequency

A

How often the sound is measured.

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

Analogue

A

Analogue sound are pure and of perfect quality.

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

Sampling

A

To record a sound, the computer samples the sound at regular points. Then it converts the sample measurements into binary code.

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

Bit rate

A

The number of bits stored per sample.

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

Metadata

A

Information added to the sound.
• Author
• Album
• Track file

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

MP3 files

A

Form of lossy compression that removes parts of the sound that are least likely to be noticed by the human ear.

17
Q

WAV files

A

WAV files are bigger than MP3 files because lossy compression is not applied to WAV files, this means that they are not as good for sharing as MP3s but are usually better quality.

18
Q

Sampling rate/frequency

A

The number of samples that are taken per second measured in Hz.

19
Q

Sample size

A

The number of bits allocated to each sample.

20
Q

File size

A

Sampling rate X Sample resolution X length

21
Q

Bit

A

A bit is one single binary digit.
A byte is 8 bits.

22
Q

Prefixes

A

Kilo, 1 kB is 1,000 bytes
Mega, 1MB is 1,000 kilobytes
Giga, 1GB is 1,000 Megabytes
Tera, 1TB is 1,000 Gigabytes

23
Q

Binary shifting

A

Left shifting by 1 = multiplication by 2
Right shifting by 1 = integer division by 2

24
Q

Binary shifting in general

A

Left shifting by n = multiplication by 2 to the power of n.
Right shifting by n = integer division by 2 to the power of n.

25
Q

Binary addition rules

A

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

26
Q

Character set

A

The group of symbols that a computer can represent and includes letters, digits, punctuation marks and control characters.

27
Q

ASCII

A

• 7-bit character set
• 128 different characters
• Represent letters of the English alphabet

28
Q

Unicode

A

• Uses up to 32 bits.
• Can be used to represent a wider range of characters and therefore other languages such as Chinese, and scientific symbols.

29
Q

Lossy compression

A

The reduction of bits, actually removing bits from a file. Can not be recovered. Some of the quality of the original file will be lost.

30
Q

Lossless compression

A

Shrinks the file down, but restores it to its original size and quality after. No loss of information.

31
Q

Why compress files?

A

• To make the files smaller.
• Less time/less bandwidth to transfer data.
• Takes up less space on the disk.

32
Q

Example of lossless compression

A

Run length encoding - sequences of the same values are stored in pairs of the value and the number of those values.

33
Q

Huffman coding

A

A from of compression that allows us to use fewer bits for higher frequency data. More common letters are represented using fewer bits than less common letters.