Back to marketplace

Chapter 5 Representing Data

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

How many bits are used for storing ASCII characters?

Back (Answer)

7

#2
Front (Question)

Drawbacks of ASCII

Back (Answer)

One language Small amount of characters

#3
Front (Question)

How many characters does Unicode store?

Back (Answer)

Over 120k

#4
Front (Question)

Why was unicode made

Back (Answer)

to store more characters across several charcters

#5
Front (Question)

drawbacks of unicode

Back (Answer)

uses more bits

#6
Front (Question)

What is a parity bit

Back (Answer)

A form of error detection which makes the number of 1’s even (for even parity) or odd (for odd parity) by changing the last bit. The 8th ascii bit is a parity bit

#7
Front (Question)

Drawbacks of a parity bit

Back (Answer)

DOuble corruption Parity bit corruption

#8
Front (Question)

What is a check digit

Back (Answer)

Added to the end of data to check (but not correct) the data

#9
Front (Question)

How is a check digit made

Back (Answer)

By find the digital root of a number (Dividing by 9 and the remainder is the check digit, unless it is 0 where 9 is then the check digit (unless the data was already 0))

#10
Front (Question)

Majority voting is?

Back (Answer)

A method which can correct data by trippling the data sent e.g. 101 -> 111000111

#11
Front (Question)

How does majority voting work?

Back (Answer)

It takes the tripled value and gets takes the most comman bit of 3. e.g. 101110001 -> 110

#12
Front (Question)

Drawbacks of majority voting

Back (Answer)

Triples the data being sent

#13
Front (Question)

What are finite state machines

Back (Answer)

Its used to recognise patterns within data

#14
Front (Question)

What do finite state machines do?

Back (Answer)

Takes a set of data and runs it through various checks and outputs new data, e.g. it could be used for calculating negative binary numbers

#15
Front (Question)

How to use a FSM

Back (Answer)

Take the first value of the data and see what path that value takes, then if the path leads to itself repeat with the next value if the path leads elsewhere start from there with the next value and so on.

#16
Front (Question)

What does signed binary mean?

Back (Answer)

Binary using two’s compliment

#17
Front (Question)

What is unsigned binary

Back (Answer)

Binary that doesnt use twos compliment

#18
Front (Question)

Which bit is the negative bit in tow’s compliment?

Back (Answer)

The most significant bit

#19
Front (Question)

How do you get a negative number?

Back (Answer)

Represent the positive number in binary, flip the bits so 1 = 0 and 0 = 1 and then add 1 e.g. 00110101 11001010 11001011

#20
Front (Question)

How do you do binary subtraction?

Back (Answer)

Do the positive number plus the negative number. (make the negative number negative using twos compliment then add it to the positive number, if there is an overflow ignore that bit)

#21
Front (Question)

What is the Hexadecimal set of numbers

Back (Answer)

First 10 numbers are the same and then A = 10 B = 11 C = 12 D = 13 E = 14 F = 15

#22
Front (Question)

How to calculate Hex to decimal

Back (Answer)

Either first convert it to binary and then calculate it or take the rightm ost digit and times it by one the go to the next digit and times it by 16 and so on before adding it all together

#23
Front (Question)

How to do binary multiplication?

Back (Answer)

go through the 2nd binary value and if there is a 0 write nothing but if there is a 1 write the 1st binary value shift n - 1 times where n = how far along you are in the 2nd binary value

#24
Front (Question)

How does fixed point work?

Back (Answer)

To the left of the Dp the number count up normally, but to the right it goes 1/2, 1/4, 1/8, 1/16