CS132 - Numerical Representations and Fundamental Knowledge

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/47

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 12:20 PM on 6/3/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

48 Terms

1
New cards

What is a bus?

A shared communication pathway that transfers data, addresses, or control signals between components.

2
New cards

What is a bit?

A single binary digit: 0 or 1.

3
New cards

What is a byte?

Usually 8 bits.

4
New cards

What is a word?

The number of bits a processor can process as a unit, e.g. 16, 32 or 64 bits.

5
New cards

What is the most significant bit (MSB)?

The bit with the highest place value, usually the leftmost bit.

6
New cards

What is the least significant bit (LSB)?

The bit with the lowest place value, usually the rightmost bit.

7
New cards

What does active high mean?

A signal/component is active when its value is 1.

8
New cards

What does active low mean?

A signal/component is active when its value is 0. A bar over a signal name often means active low.

9
New cards

What base is decimal?

Base 10, using digits 0 to 9.

10
New cards

What base is binary?

Base 2, using digits 0 and 1.

11
New cards

What base is octal?

Base 8, using digits 0 to 7.

12
New cards

What base is hexadecimal?

Base 16, using digits 0 to 9 and A to F.

13
New cards

How do you convert decimal to another base?

Repeatedly divide by the target base, record remainders, then read the remainders from bottom to top.

14
New cards

How do you convert binary to octal?

Group binary bits in 3s from the right, because 2^3 = 8.

15
New cards

How do you convert binary to hexadecimal?

Group binary bits in 4s from the right, because 2^4 = 16.

16
New cards

How do you convert any base to decimal?

Multiply each digit by base^position and add the results.

17
New cards

Why is binary addition similar to decimal addition?

You add from the least significant bit and carry to the next column when the result is too large for one digit.

18
New cards

How can subtraction be treated as addition?

Use A - B = A + (-B), where -B is represented using two's complement.

19
New cards

What is signed magnitude?

A signed representation where the first bit is the sign bit and the remaining bits give the magnitude.

20
New cards

In signed magnitude, what do sign bits 0 and 1 mean?

0 means positive; 1 means negative.

21
New cards

Give one advantage of signed magnitude.

The sign is easy to inspect and sign/magnitude can be handled separately, useful for signed magnitude multiplication.

22
New cards

Give two disadvantages of signed magnitude.

It has +0 and -0, and addition/subtraction circuits are more complicated.

23
New cards

What is two's complement?

A binary representation for signed integers where negative x is found by inverting the bits of x and adding 1.

24
New cards

How do you find the two's complement negative of a binary number?

Invert all bits, then add 1.

25
New cards

How do you subtract using two's complement?

Convert the second number to two's complement, add it to the first number, and ignore any final carry beyond the fixed width.

26
New cards

Why is two's complement useful for subtraction?

The same binary adder circuit can perform addition and subtraction.

27
New cards

What is overflow?

A result is too large or too small to fit in the fixed number of bits available.

28
New cards

When can signed overflow occur?

When adding two positive numbers gives a negative result, or adding two negative numbers gives a positive result in fixed-width signed arithmetic.

29
New cards

What is biased form?

A way to store signed exponents by adding a fixed bias: stored exponent = real exponent + bias.

30
New cards

Why is biased exponent form useful?

It represents positive and negative exponents without using two's complement.

31
New cards

What is fixed point representation?

A representation where the binary point is assumed to be in a fixed position.

32
New cards

Give two advantages of fixed point.

It is simple, fast and predictable.

33
New cards

Give two disadvantages of fixed point.

It is less flexible and has a limited range/precision layout fixed in advance.

34
New cards

What is IEEE 754 floating point used for?

Representing very large and very small fractional numbers.

35
New cards

What are the three parts of an IEEE 754 floating point number?

Sign bit, biased exponent, and mantissa/significand.

36
New cards

What does the sign bit do in floating point?

It shows whether the number is positive or negative.

37
New cards

What does the biased exponent do in floating point?

It stores the scale/power of two, using a bias to allow positive and negative exponents.

38
New cards

What does the mantissa/significand do in floating point?

It stores the precision/detail of the number.

39
New cards

Fixed point vs floating point: when is fixed point preferable?

When hardware should be simple, fast and predictable, and the range of values is known.

40
New cards

Fixed point vs floating point: when is floating point preferable?

When a much wider range of very small and very large values is needed.

41
New cards

How do you multiply unsigned binary numbers?

Use long multiplication with binary rules: 0 times anything is 0; 1 times 1 is 1; then add shifted partial products.

42
New cards

How do you multiply signed magnitude numbers?

Ignore sign bits, multiply magnitudes as unsigned numbers, determine the sign separately, then attach the correct sign bit.

43
New cards

Why is two's complement multiplication more complex than signed magnitude multiplication?

The sign is built into the bit pattern, so a special algorithm such as Booth's algorithm may be needed.

44
New cards

Basic Booth's algorithm idea?

Look at pairs of multiplier bits: 10 subtract, 01 add, 00 or 11 do nothing, then arithmetic shift right and repeat.

45
New cards

How do you multiply two IEEE 754 floating point numbers?

XOR sign bits, add exponents and subtract the bias once, multiply mantissas, normalise, then round if needed.

46
New cards

Why is floating point multiplication simpler than floating point addition?

The exponents do not need to be aligned before multiplying mantissas.

47
New cards

What is a possible advantage of ternary/base-3 over binary?

It can represent more values per digit, so fewer digits may be needed for the same range.

48
New cards

What is a disadvantage of ternary/base-3 hardware?

Voltage ranges are closer together, making noise/error margins worse and hardware design more difficult.