Unit 5 - Fundamentals of data representation Flashcards

1
Q

What are natural numbers?

A

All positive numbers

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

What are integer numbers?

A

All positive / negative numbers

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

What are rational numbers?

A

All fractional numbers

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

What are irrational numbers?

A

Numbers that can’t be written as a fraction

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

What are real numbers?

A

All positive or negative value and can include a fractional part

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

What are ordinal numbers?

A

Describe the position/placing of an item

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

What is a parity bit?

A

a bit set at the transmitting end for error detection

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

What is a check digit?

A

Additional digit at the end of a string to check for mistakes in input

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

What is majority voting?

A

Majority rule that assumes that if majority bits have not changed it is correct

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

What are analogue and digital signals?

A

Analogue - continouus

Digital - discrete

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

How is analogue converted into digital?

A
  • Sample measured by wave height
  • Translated into an integer value
  • Then converted and stored digitally as binary value
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is sampling?

A

Process of converting analogue to digital

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

What is sample resolution?

A

The number of bits used to record each measurement

- More bits = higher resolution (better accuracy)

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

What is sampling rate?

A

The frequency or number of samples per second

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

How do you calculate the file size?

A

File size (Bytes) = sample rate(Hz) x resolution(pixels)x length in seconds

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

What is Nyquist Theorem?

A

You must use a sampling rate at double the frequency of the original sound
fs > 2fmax

17
Q

What is MIDI?

A

Musical Instrument Digital Interface

  • Allows electronic musical instruments to communicate with each other
  • Uses less disk space than digital recording
18
Q

What are event messages?

A

Sends and receives specific messages to each device

  • Duration of note
  • Pitch
  • Volume change
  • Vibrato
  • Tempo
19
Q

What is bitmap resolution?

A

The number of pixels used to make up a bitmap image

- width x height

20
Q

What is colour depth?

A

The number of bits or bytes allocated to represent the colour of a pixel in a bitmap
- storage = resolution x colour depth

21
Q

What is metadata?

A

data about data

  • date created
  • colour depth etc
22
Q

What does reducing data size do?

A
  • Data sent more quickly
  • Less storage required
  • Less bandwith used
23
Q

What is lossy compression?

A

Non-essential data is
permanently removed
- JPEG & MP3
- Loses original data

24
Q

What is lossless compression?

A

No data removed but data is rearranged to be more efficient

  • Higher file size
  • No loss in quality
25
What is run length encoding?
Groups together repeated bits
26
What is dictionary compression?
Spots regularly occurring data and stores it separately in a dictionary - Produces additional data for the dictionary itself
27
What is encryption?
data that cant be understood and needs to be decrypted to be understood
28
What is Caesar cipher?
An old encryption but Julius Caesar | - realigining alphabet and shifting to encrypt
29
Disadvantages of Caeser cipher
- Only 25 possible keys - Only encrypts letters - Key is constant, so when one match is found, rest will be easily found
30
What is the Verman cipher (One time pad cipher)?
A key that is only used once to encrypt and decrypt a message and is then discarded - Truly random - more or equal length of plain text - Used XOR logic gates
31
Why is the Verman cipher 'perfect security'?
- Truly random - Never reused - Must be kept secret
32
Limitations of Verman cipher
- Key must be more or equal size - They must be random every time - Long keys hard to remember
33
What is two's compliment
A method of working with signed binary values.
34
What is fixed point binary?
A way of representing binary fractions