Representing Text Flashcards

(39 cards)

1
Q

What is a character set?

A

a list of characters and the codes used to represent each one

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

What does ASCII stand for?

A

American Standard Code for Information Interchange

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

The original ASCII had how many bits?

A

7 for 128 unique characters

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

How many control characters are there?

A

33

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

How many bits does the “later/new” ASCII have?

A

8

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

The first and last ____ of the ASCII are control characters/hidden characters

A

32

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

Uppercase letters start when?

A

65

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

Lowercase letters start when?

A

97

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

What is the difference between the upper and lower case letters?

A

32

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

Where is 0-9 coded consecutively?

A

48-57

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

Where is A-Z coded consecutively?

A

65-90

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

Where is a-z coded consecutively?

A

97-122

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

What is Unicode?

A

superset of ASCII
- bigger character set than ASCII

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

How many bits are in Unicode?

A

16

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

True or False
In Unicode, 1-127 is the same as ASCII, but 128-255 are symbols and accented letters

A

True

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

What is data compression?

A

It is a reduction in the amount of space needed to store a piece of data

17
Q

What is ratio compression?

A

It is the size of the compressed data divided by the size of the original data

18
Q

What are the 2 techniques for data compression?

A
  1. Lossless
  2. Lossy
19
Q

What does Lossless mean?

A

The data can be retrieved without any loss of the original information

20
Q

What does Lossy mean?

A

Some information may be lost in the process of compaction

21
Q

What are the 3 examples of techniques for data compression?

A
  1. Keyword encoding
  2. Run-length encoding
  3. Huffman encoding
22
Q

Is Keyword encoding effective?

A

No, it is the least effective

23
Q

Which technique is good for compressing data with lots of spaces?

A

Run-length encoding

24
Q

Which example is the most effective?

A

Huffman encoding

25
What are examples of Huffman encoding?
JPG, MP3, ZIP
26
What does Keyword encoding refer to?
Words are replaced with a symbol
27
What is the limitation rule to the Keyword encoding?
Symbols used cannot be in the original data
28
What does Run-length encoding refer to?
Words with multiple instances of the same letters beside each other can use a number instead
29
What does Huffman coding refer to?
The idea of Morse code - Only using a few bits to represent characters - Some characters will be represented by 5 bits and others by 6 bits
30
Does the Huffman coding allow for ASCII?
No, it neglects it and uses a different number of bits, not 8
31
What are the 4 steps in Huffman's Algorithm?
1. Count Frequencies 2. Sort in ascending order 3. Start merging the letter and number into a tree diagram 4. Label branches
32
Typically, which branches are labelled with 0 and which are labelled with 1?
Left branch = 0 Right branch = 1
33
For Huffman's Algorithm, what is our input?
symbols and their frequency counts
34
For Huffman's Algorithm, what is our output?
binary code for each symbol
35
For Huffman's Algorithm, what is our property?
optimum compression rate with the prefix property
36
Where would we find the prefix property in the tree diagram?
displayed at the leaf node
37
What is the optimum compression ratio?
merge the least frequent first and the most frequent last
38
What is the compression's bit length?
sum of char-code length x frequency-count
39
What are examples of run-length encoding?
white spaces in faxes