1/20
Vocabulary flashcards covering number systems, base conversions, integer representations (true form, one's complement, two's complement), and floating-point standards (IEEE 754).
Decimal System
A base-10 numeral system composed of ten digits (0–9) that functions on the rule of "carry one when reaching ten".
Binary System
A base-2 numeral system composed of two digits (0 and 1) operating on the rule of "carry one when reaching two", chosen by computers due to physical transistor states and simplified arithmetic rules.
Place Value Expansion
A conversion method where each digit of a number is multiplied by its corresponding base power and summed together (D=∑(bi×basei)) to calculate its decimal equivalent.
Divide by 2, Take Remainder Method
The standard procedure for converting a decimal integer into binary by repeatedly dividing by 2, recording each remainder until the quotient is 0, and arranging the remainders in reverse order (bottom to top).
Multiply by 2, Take Integer Part Method
The procedure for converting a decimal fraction into binary by repeatedly multiplying the fractional portion by 2 and recording the resulting integer parts in forward order until the fraction becomes 0 or the required precision is reached.
Finite Precision Problem
A computational limitation where certain decimal fractions (such as 0.6) cannot be represented with finite binary digits and become repeating decimals, leading to rounding errors in floating-point arithmetic.
Three-Digit Grouping Method
The conversion method between binary and octal based on 8=23, where binary digits are partitioned into groups of three (from right to left for integers and left to right for fractions, padded with 0 if needed) to form octal digits.
Four-Digit Grouping Method
The conversion method between binary and hexadecimal based on 16=24, where binary digits are partitioned into groups of four to map directly to hexadecimal digits (0–9, A–F).
True Form (Sign-Magnitude)
An integer encoding representation where the highest bit represents the sign (0 for positive, 1 for negative) and the remaining bits directly represent the absolute magnitude of the number.
Limitations of True Form
Encoding drawbacks including the redundant dual representation of zero (+0 as 00000000 and −0 as 10000000) and complex arithmetic logic requiring sign comparison that leads to calculation errors when adding numbers with opposite signs directly (e.g., 5+(−5)=−10).
One's Complement
An integer encoding representation where positive numbers are identical to true form, and negative numbers keep the sign bit unchanged while inverting all magnitude bits bit by bit.
End-Around Carry
An additional corrective handling step required during one's complement arithmetic whenever a carry occurs, making hardware addition and subtraction logic less concise and efficient.
Two's Complement
The standard integer encoding in computer architecture where positive numbers equal true form and negative numbers are formed by adding 1 to their one's complement (One’s Complement+1).
Modulus in Two's Complement
The modular base 2n for an n-bit binary representation (e.g., 28=256 for 8 bits), allowing a negative number −B to be represented as 2n−B, which converts subtraction into modular addition.
Unified Addition and Subtraction
The operational advantage of two's complement where subtraction is executed as addition via A−B=A+(∼B+1) and high-bit carry is discarded, allowing arithmetic logic units to execute both operations using a single adder circuit without sign judgment.
Floating-Point Representation
A real number representation system based on scientific notation that formats numbers as (−1)S×1.M×2E−bias, exchanging some precision for an enormous dynamic range of values.
Exponent Bias
A fixed constant added to the actual exponent in IEEE 754 standards (127 for single precision, 1023 for double precision) so that both positive and negative exponents can be stored as non-negative unsigned integers.
IEEE 754 Single-Precision Floating-Point
A 32-bit standard format comprising a 1-bit sign bit (S), an 8-bit exponent (E) with a bias of 127, and a 23-bit mantissa (M), spanning a range of approximately ±1.18×10−38 to ±3.4×1038.
IEEE 754 Double-Precision Floating-Point
A 64-bit standard format comprising a 1-bit sign bit (S), an 11-bit exponent (E) with a bias of 1023, and a 52-bit mantissa (M) providing 53 bits of actual precision, spanning approximately ±2.23×10−308 to ±1.80×10308.
Floating-Point Rounding Error
A discrepancy caused by truncating infinite repeating binary decimals into a fixed mantissa length, resulting in non-exact arithmetic results such as 0.1+0.2=0.3.
Epsilon Comparison
An engineering technique that avoids direct equality checks (==) on floating-point numbers by testing whether their absolute difference falls within a small predefined error tolerance range.