Data Rep Flashcards

1
Q

How does Twos Complement work?

A

Most significant bit is given a negative value

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

Range of Twos Complement?

A

2^(n-1)-1 to -2^(n-1)

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

Floating point - Binary to Decimal

A

Convert the exponent to decimal (x)
Place a point x+1 digits into binary number
Convert everything to decimal as you would normally

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

Floating point - Decimal to Binary

A

First, find binary version normally
Add a zero to the leftmost side
Move the point to the left until in-between the 0 and 1, count how many movements
Convert number of movements to binary - that is the exponent. Mantissa is the OG binary conversion incl 0

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

Absolute error method

A

Difference between actual and given decimal values.

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

Relative error method

A

Abs error/Actual value
multiplied by 100

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

Floating Point allows for…

A

Allows for larger range of numbers with a given number of bits as exponent can be negative or positive
Large Exponent and small mantissa allows a large range but little precision

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

Normalisation Method

A

Split into mantissa and exponent
Shift x positions left or right to get 10 or 01 start
Take away x from decimal exponent value
Combine new mantissa and exponent

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

Underflow Def

A

When very small numbers are being represented but there aren’t enough bits available.

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

Analogue to Digital Conversion

A

ADC takes regular readings (samples) of analogue signal per second
Samples are quantised
Stored digitally as a bit pattern

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

Storage formula for Bitmap image

A

Area*Bit Depth
Minimum value however, may also contain metadata eg height, width, date created and colour depth

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

Vector Graphics

A

Geometric shapes stored in a list
List also stores colours, start positions, fill styles, dimensions

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

Vector Graphics vs Bitmaps

A

Vector graphics use shapes not pixels hence can be scaled with our quality loss
VG well suited to logos etc but useless for photos
VG uses less storage space as info is stored for each shape instead of each pixel

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

Sound size formula

A

Duration * Sample rate * Sample resolution
+ metadata

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

Nyquist Theorem

A

Sampling rate must be double sound frequency to accurately represent sound

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

MIDI

A

Musical Instrument Digital Interface
Stores event messages instead of sound
Event message contains volume of note, pitch, instrument used etc

17
Q

MIDI Pros and Cons

A

Easy manipulation of music without loss in quality
Smaller in size and lossless
HOWEVER produces less realistic sound and can’t be used for storing speech

18
Q

Lossy compression

A

Compression with loss of data

19
Q

Lossless compression

A

RLE - replaces everything with number of times it occurs in a row
If high level of unique values present then compression is ineffective

Dictionary - Each token is shown given a key, and data is replaced by keys. Dictionary appended to the file.

20
Q

How does the vernam cipher work

A

Aligns plaintext and the key
Converts each character into binary
Applies XOR to the two rows
Converts back into character

21
Q

4 error checking methods

A

Parity bit - Odd parity makes sure total number of 1s is odd
Majority Voting
Check digit
Checksum - data is modded and then appended to the packet. checked on the other side.