Chapter 2 Binary Values and Number Systems
Numbers Natural numbers, a.k.a. positive integers Zero and any number obtained by repeatedly adding one to it. Examples: 100, 0, 45645, 32 Negative numbers A value less than 0, with a sign Examples: -24, -1, -45645, -32 2 2
Integers A natural number, a negative number, zero Examples: 249, 0, - 45645, - 32 Rational numbers An integer or the quotient of two integers Examples: -249, -1, 0, 3/7, -2/5 Real numbers In general cannot be represented as the quotient of any two integers. They have an infinite # of fractional digits. Example: Pi = 3.14159265 3 3
2.2 Positional notation How many ones (units) are there in 642? 600 + 40 + 2? Or is it 384 + 32 + 2? Or maybe 1536 + 64 + 2? 4 4
Positional Notation 642 is 600 + 40 + 2 in BASE 10 The base of a number determines how many digits are used and the value of each digit s position. To be specific: In base R, there are R digits, from 0 to R-1 The positions have for values the powers of R, from right to left: R 0, R 1, R 2, 5 5
Positional Notation In our example: 642 in base 10 positional notation is: 6 x 10 2 = 6 x 100 = 600 + 4 x 10 1 = 4 x 10 = 40 + 2 x 10º = 2 x 1 = 2 = 642 in base 10 This number is in base 10 The power indicates the position of the digit inside the number 6 6
Positional Notation Formula: R is the base of the number d n * R n-1 + d n-1 * R n-2 +... + d 2 * R + d 1 n is the number of digits in the number d is the digit in the i th position in the number 642 is 6 3 * 10 2 + 4 2 * 10 + 2 1 7 7
Positional Notation reloaded The text shows the digits numbered like this: d n * R n-1 + d n-1 * R n-2 +... + d 2 * R + d 1 but, in CS, the digits are numbered from zero, to match the power of the base: d n-1 * R n-1 + d n-2 * R n-2 +... + d 1 * R 1 + d 0 * R 0 8 7
Positional Notation What if 642 has the base of 13? + 6 x 13 2 = 6 x 169 = 1014 + 4 x 13 1 = 4 x 13 = 52 + 2 x 13º = 2 x 1 = 2 = 1068 in base 10 642 in base 13 is equal to 1068 in base 10 642 13 = 1068 10 9 68
Positional Notation In a given base R, the digits range from 0 up to R 1 R itself cannot be a digit in base R Trick problem: Convert the number 473 from base 6 to base 10 10
Binary Decimal is base 10 and has 10 digits: 0,1,2,3,4,5,6,7,8,9 Binary is base 2 and has 2 digits: 0,1 11 9
12
Converting Binary to Decimal What is the decimal equivalent of the binary number 1101110? 1101110 2 =??? 10 13 13
Converting Binary to Decimal What is the decimal equivalent of the binary number 1101110? 1 x 2 6 = 1 x 64 = 64 + 1 x 2 5 = 1 x 32 = 32 + 0 x 2 4 = 0 x 16 = 0 + 1 x 2 3 = 1 x 8 = 8 + 1 x 2 2 = 1 x 4 = 4 + 1 x 2 1 = 1 x 2 = 2 + 0 x 2º = 0 x 1 = 0 = 110 in base 10 14 13
QUIZ: 10011010 2 =??? 10 15
Bases Higher than 10 How are digits in bases higher than 10 represented? Base 16 (hexadecimal, a.k.a. hex) has 16 digits: 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E, F 16 10
Converting Hexadecimal to Decimal What is the decimal equivalent of the hexadecimal number DEF? D x 16 2 = 13 x 256 = 3328 + E x 16 1 = 14 x 16 = 224 + F x 16º = 15 x 1 = 15 = 3567 in base 10 17
QUIZ: 2AF 16 =??? 10 18
Converting Octal to Decimal What is the decimal equivalent of the octal number 642? 642 8 =??? 10 19 11
Converting Octal to Decimal What is the decimal equivalent of the octal number 642? 6 x 8 2 = 6 x 64 = 384 + 4 x 8 1 = 4 x 8 = 32 + 2 x 8º = 2 x 1 = 2 = 418 in base 10 20 11
Are there any non-positional number systems? Hint: Why did the Roman civilization have no contributions to mathematics? 21
Today we ve covered pp.33-39 of the text (stopped before Arithmetic in Other Bases) Solve in notebook for next class: 1, 2, 3, 4, 5, 20, 21, 22 22
QUIZ: Convert to decimal 1101 0011 2 =??? 10 AB7 16 =??? 10 513 8 =??? 10 692 8 =??? 10 23
Addition in Binary Remember that there are only 2 digits in binary, 0 and 1 1 + 1 is 0 with a carry 0 1 1 1 1 1 1 0 1 0 1 1 1 +1 0 0 1 0 1 1 1 0 1 0 0 0 1 0 Carry Values 24 14
Addition QUIZ 1 0 1 0 1 1 0 +1 0 0 0 0 1 1 Carry values go here Check in base ten! 25 14
Subtraction in Binary Remember borrowing? Apply that concept here: Borrow values 1 2 0 2 0 2 1 0 1 0 1 1 1 1 0 1 0 1 1 1-1 1 1 0 1 1-1 1 1 0 1 1 0 0 1 1 1 0 0 0 0 1 1 1 0 0 Check in base ten! 26 15
Subtraction QUIZ 1 0 1 1 0 0 0-1 1 0 1 1 1 Borrow values Check in base ten! 27 15
Converting Decimal to Other Bases Algorithm for converting number in base 10 to any other base R: While (the quotient is not zero) Divide the decimal number by R Make the remainder the next digit to the left in the answer Replace the original decimal number with the quotient A.k.a. repeated division (by the base): 28 19
Converting Decimal to Binary Example: Convert 179 10 to binary 179 2 = 89 rem. 1 2 = 44 rem. 1 2 = 22 rem. 0 2 = 11 rem. 0 MSB LSB 2 = 5 rem. 1 2 = 2 rem. 1 2 = 1 rem. 0 179 10 = 10110011 2 2 = 0 rem. 1 Notes: The first bit obtained is the rightmost (a.k.a. LSB) The algorithm stops when the quotient (not the remainder!) becomes zero 29 19
Repeated division QUIZ Convert 42 10 to binary 42 2 = rem. 42 10 = 2 30 19
The repeated division algorithm can be used to convert from any base into any other base, but we use it only for 10 2 SKIP Converting Decimal to Octal Converting Decimal to Hex 31
Converting Binary to Octal Mark groups of three (from right) Convert each group 10101011 10 101 011 2 5 3 10101011 is 253 in base 8 32 17
Converting Binary to Hexadecimal Mark groups of four (from right) Convert each group 10101011 1010 1011 A B 10101011 is AB in base 16 33 18
Counting Note the patterns! 34
Converting Octal to Hexadecimal End-of-chapter ex. 25: Explain how base 8 and base 16 are related 10 101 011 1010 1011 2 5 3 A B 253 in base 8 = AB in base 16 35 18
Binary Numbers and Computers Computers have storage units called binary digits or bits Low Voltage = 0 High Voltage = 1 All bits are either 0 or 1 36 22
Binary and Computers Word= group of bits that the computer processes at a time The number of bits in a word determines the word length of the computer. It is usually a multiple of 8. 1 Byte = 8 bits 8, 16, 32, 64-bit computers 128? 256? 37 23
Individual work Read Grace Hopper s bio, the trivia frames, chapter review questions, and ethical issues 38
Who am I? I wrote the world s first compiler in 1952! 39
From the history of computing: bi-quinary Roman abacus (source: MathDaily.com) The front panel of the legendary IBM 650 IBM 650 (source: Wikipedia) 40
Chapter Review questions Describe positional notation Convert numbers in other bases to base 10 Convert base-10 numbers to numbers in other bases Add and subtract in binary Convert between bases 2, 8, and 16 using groups of digits Count in binary Explain the importance to computing of bases that are powers of 2 41 24 6
Homework Due next Friday, Feb. 3: End-of-chapter ex. 23, 26, 28, 29, 30, 31, 38 End-of-chapter thought question 4 (paragraph-length answer required) The latest homework assigned is always available on the course webpage 42