Unit 3 - Data representation Flashcards

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

What are natural numbers?

A

Natural numbers are integers greater than 0.

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

What are ordinal numbers?

A

The numbers indicating order of occurrence (1st, 2nd, 3rd, etc.)

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

Advantages of using hexidecimal:

A
  • A hexadecimal value is much easier to read and
    remember than a string of binary digits
  • It is quicker to write or type, since a hex digit takes
    up only one character, not four
  • There is less chance of making an error when typing
    hex characters than a string of 1s and 0s
  • It is very easy to convert to and from binary
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How many possible binary codes does ASCII allow for?

A

256

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

What are the first 32 characters in the ASCII table?

A

The first 32 characters are all control characters, such as backspace.

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

How many characters in the ASCII table are control characters?

A

The first 32 characters are all control characters.

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

How many bits make up the characters in Unicode?

A

Either 16 or 32 bits.

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

How are parity bits used?

A

Parity bits are used in error detection. When a byte of data is sent, a parity bit is set to a 1 or a 0 to make the total numbers of 1s in the byte either even or odd depending on the machine.

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

How does majority voting work?

A

Majority voting is a method of error detection that requires each bit of data being sent three times. From the three bits, a 1 or 0 is chosen based on which one appears more.

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

What is a checksum and what is its purpose?

A

A checksum is an error checking algorithm that can be applied to a packet of data. The algorithm is applied to the packet to calculate a check digit, which is transmitted with the packet. Upon arrival, the same algorithm is applied to make sure the same check digit is obtained.

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

How does capturing an image using a digital camera work (ignoring colour)?

A

The image is broken up into a grid of pixels and light sensors are used to detect the intensity/brightness at each pixel. These measurements are converted into a binary code using an analogue-to-digital converter.

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

How does a digital camera recognise colour?

A

Each pixel of the image is mapped from a set of filters (red, green and blue). The intensity of the individual filters can be used to calculate the amount of their respective wavelength of light.

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

What electrical component is used to convert light sensor measurements into binary codes?

A

An analogue-to-digital converter.

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

How are bit-mapped graphics represented.

A

They are represented by a grid of pixels, each holding a colour value.

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

What are the differences between analogue and digital data? (discrete or continuous?)

A

Analogue data is continuous by nature; the distance between two points would be analogue since you can forever increase the accuracy of measurement… kind of. Discrete data is much more definitive; a byte is discrete because the potential numbers it represents are fixed.

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

What is meant by the sample resolution of an analogue signal?

A

The sample resolution is the number of bits used to record each measurement.

17
Q

If a recording took a sample every S seconds with a resolution of R over a time of T, what would the resultant file size be? (expressed in terms of S, R, T)

A

File size = R * T * 1/S

18
Q

What does the Nyquist Theorem state?

A

When sampling a signal, the sampling frequency must be greater than twice the frequency of the input signal so that the reconstruction of the original image will be as close to the original signal as possible.

19
Q

What does MIDI stand for and how is it different to traditional recording methods?

A

MIDI (Musical Instrument Digital Interface) creates sounds as requested by software instead of translations of real instruments.

20
Q

How could lossy compression be used for an audio file?

A

Lossy compression removes the sounds in the frequency ranges that humans can’t perceive. It may also remove quieter notes that are played at the same time as louder ones.

21
Q

Give an example of lossless compression and how it works (spoiler: it starts with R).

A

RLE (Run Length Encoding) notices consecutive patterns of the same data and shortens them into what in English is “3x data” instead of “data + data + data”.

22
Q

Give an example of lossless compression and how it works (spoiler: it starts with a D).

A

Dictionary compression spots regularly occurring data and stores that data in a dictionary. The data within the main section of the file is then replaced to refer to the dictionary.

23
Q

How can frequency analysis be used to break simple encryption?

A

Some letters in the alphabet, such as “S”, are much more common than others. Counting how often a certain letter appears in an encrypted document can narrow which letters it could be. This only works against garbage encryption such as Caesar cipher.

24
Q

How does the Vernam cipher work?

A

A completely random “one-time pad” is generated that is greater than or equal to the text in length. The pad is shared securely and a XOR operation is applied to every pair of data bits.

25
Q

What is the symbol for a kibibyte and how many bits does it contain?

A

KiB holding 1024 bits.