SLR13 Coding sound and music Flashcards

1
Q

Sample resolution

A

“The representation (or size of the numbers) used to write samples in digital sound recording.”

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

Sampling rate

A

“This is a value typically expressed in samples per second, or hertz (Hz), it represents the rate at which samples of an analogue signal are taken to be converted into digital form.”

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

Nyquist theorem

A

“Also known as the sampling theorem, is a principle that engineers follow in the digitisation of analogue signals. For analogue-to-digital conversion (ADC) to result in a faithful reproduction of the signal, slices, called samples, of the analogue waveform must be taken frequently.”

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

Musical Instrument Digital Interface

A

“A widely used standard for interconnecting electronic musical instruments and computers.”

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

Lossy compression

A

“A compression scheme that generally involves a loss of resolution in parts of the image where experience shows it will be least noticed.”

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

Lossless compression

A

“A compression scheme that allows the original images to be recreated.”

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

Run-length encoding

A

“A very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run.”

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

Dictionary-based encoding

A

“A class of lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure maintained by the encoder.”

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

Encryption

A

“The process of making data in a computer system unintelligible.”

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

Caesar cipher

A

“One of the simplest forms of encryption. It is a substitution cipher, where each letter in the message (plaintext) is replaced with a letter corresponding to a certain number of letters up or down in the alphabet. In this way, a message that initially was quite readable ends up in a form that cannot be understood at a simple glance.”

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

Vernam cipher

A

“Cipher that is based on the principle that each plaintext character from a message is ‘mixed’ with one character from a key stream. If a truly random key stream is used, the result will be a truly ‘random’ ciphertext which bears no relation to the original plaintext.”

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

“The representation (or size of the numbers) used to write samples in digital sound recording.”

A

Sample resolution

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

“This is a value typically expressed in samples per second, or hertz (Hz), it represents the rate at which samples of an analogue signal are taken to be converted into digital form.”

A

Sampling rate

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

“Also known as the sampling theorem, is a principle that engineers follow in the digitisation of analogue signals. For analogue-to-digital conversion (ADC) to result in a faithful reproduction of the signal, slices, called samples, of the analogue waveform must be taken frequently.”

A

Nyquist theorem

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

“A widely used standard for interconnecting electronic musical instruments and computers.”

A

Musical Instrument Digital Interface

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

“A compression scheme that generally involves a loss of resolution in parts of the image where experience shows it will be least noticed.”

A

Lossy compression

17
Q

“A compression scheme that allows the original images to be recreated.”

A

Lossless compression

18
Q

“A very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run.”

A

Run-length encoding

19
Q

“A class of lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure maintained by the encoder.”

A

Dictionary-based encoding

20
Q

“The process of making data in a computer system unintelligible.”

A

Encryption

21
Q

“One of the simplest forms of encryption. It is a substitution cipher, where each letter in the message (plaintext) is replaced with a letter corresponding to a certain number of letters up or down in the alphabet. In this way, a message that initially was quite readable ends up in a form that cannot be understood at a simple glance.”

A

Caesar cipher

22
Q

“Cipher that is based on the principle that each plaintext character from a message is ‘mixed’ with one character from a key stream. If a truly random key stream is used, the result will be a truly ‘random’ ciphertext which bears no relation to the original plaintext.”

A

Vernam cipher