Chapter 1. Binary, octal and hexadecimal numbers

Save this PDF as:
Size: px
Start display at page:

Transcription

1 Chapter 1. Binary, octal and hexadecimal numbers This material is covered in the books: Nelson Magor Cooke et al, Basic mathematics for electronics (7th edition), Glencoe, Lake Forest, Ill., [Hamilton L62*6] See chapter 36. Wilson T. Price, Charles Peselnick, Elements of data processing mathematics (3rd edition), Holt, Rinehart and Winston, [Hamilton 510 M71] See chapter 2. However, I hope that the explanations given here are adequate. The material here is probably new to you, but it should not require any prior knowledge. It really starts with primary school mathematics and is all more or less common sense. The rationale for including this material in the course is that the ideas are used all through computing, at least once you look under the cover of a computer. Counting 1.1 Normally we use decimal or base 10 when we count. What that means is that we count by tens, hundreds = tens of tens, thousands = tens of hundreds, etc. We see that in the SI units we are familiar with in science (kilometres = 10 3 metres, kilogrammes, centimetres = 10 3 metres). We can become so used to it that we don t think about it. When we write the number 5678, we learned in the primary school that the 8 means 8 units, the 7 is 7 tens, while the remaining digits are 6 hundreds = and So the number 5678 means Although base 10 is the most common, we do see some traces of other bases in every day life. For example, we normally buy eggs by dozens, and we can at least imagine shops buying eggs by the gross (meaning a dozen dozen or 12 2 = 144). So we use base 12 to some extent. We can see some evidence of base 60 in angles and in time. In time units, 60 seconds is a minute and 60 minutes (= 60 2 seconds) is an hour. Logically then we should have 60 hours in a day? Since we don t we stop using base 60. In degree measure of angles, we are familiar with 60 minutes in a degree. Binary 1.2 In binary or base 2 we count by pairs. So we start with zero, then a single unit, but once we get to two units of any size we say that is a pair or a single group of 2. So, when we count in base 2, we find: 1 is still 1 2 becomes a single group of 2 (a single pair) Using positional notation as we do for decimal, we write this as 10. To make sure we are clear which base we are using, we may write a subscript 2 as in (10) 2

2 Mathematics 1S3 (Timoney) 3 is (11) 2 = one batch of 2 plus 1 unit. 4 is (100) 2 = one batch of batches of units Using a more succinct format, we can explain how to count in binary as follows: Decimal # in binary Formula for the binary format 1 (1) (10) (11) (100) (101) (110) (111) (1000) So we can figure out what number we mean when we write something in binary by adding up the formula. Mind you that can get tedious, but the principle is not complicated. At least for small numbers, there is a way to find the binary digits for a given number (i.e., given in base 10) by repeatedly dividing by 2. For very small numbers, we can more or less do it by eye. Say for the number twenty one, we can realise that it is more than 16 = 2 4 and not as big as 32 = 2 5. In fact 21 = = = = (10101) 2 Or we can start at the other end and realise that since 21 is odd its binary digits must end in 1. 21/2 = 10+ remainder 1. So last binary digit is 1 = that remainder. Now 10/2 = 5+ no remainder. That makes the digit in the 2 s place 0. 5/2 = 2+ remainder 1. So if we repeatedly divide by 2 and keep track of the remainder each time (even when the remainder is zero) we discover the binary digits one at a time from the units place up. One thing to notice about binary is that we only ever need two digits, 0 and 1. We never need the digit 2 because that always gets carried or moved to the next place to the left. Octal 1.3 In octal or base 8 we count by 8 s. Otherwise the idea is similar. We need 8 digits now: 0, 1, 2, 3, 4, 5, 6 and 7. So now zero is still 0 in octal, 1 is 1, 2 is 2, etc. 7 is still 7 in octal, but eight becomes (10) 8. In base 8 (10) 8 means Using a layout similar to the one used before we can explain how to count in octal as follows:

3 Binary, octal and hexadecimal numbers 3 Decimal # in octal Formula for the octal format 1 (1) (2) (7) (10) = 0 9 (11) (12) (20) (21) Hex 1.4 Now we have the idea, we can think of counting in other bases, such as base 6 or base 9, but these are not used in practice. What is used is base 16, also called hexadecimal. We can go ahead as we did before, just counting in groups and batches of 16. However, we run into a problem with the notation caused by the fact that the (decimal) number 10, 11, 12 13, 14 and 15 are normally written using two adjacent symbols. If we write 11 in hexadecimal, should we mean ordinary eleven or ? To get around this difficulty we need new symbols for the numbers ten, eleven,..., fifteen. What we do is use letters a, b, c, d, e and f (or sometimes the capital letters A, B, C, D, E and F). Thus the number ten becomes a single digit number (a) 16 in hexadecimal. Eleven becomes (b) 16, and so on. But sixteen becomes (10) 16. Using a layout similar to the one used before we can explain how to count in hex as follows: Decimal # in hex Formula for the hexadecimal format 1 (1) (9) (a) (f) (10) = 0 17 (11) (1a) (20) (a5) (100) Relation with computers 1.5 Although computers are very sophisticated from the outside, with all kinds of flashy buttons, screens and so forth, the basic works are essentially many rows of on/off switches. Clearly a single on/off switch has only 2 possible settings of or states, but a row of 2 such switches has 4 possible states. on on on off off on off off

4 Mathematics 1S3 (Timoney) A row of 3 switches has twice as many possible setting because the third switch can be either on or off for each of the 4 possibilities for the first two. So 2 3 possibilities for 3 switches. In general 2 8 = 256 possibilities for 8 switches, 2 n possible settings for a row of n switches. Computers generally work with groups of 32 switches (also called 32 bits, where a bit is the official name for the position that can be either on or off) and sometimes now with groups of 64. With 32 bits we have a total of 2 32 possible settings. How big is 2 32? We could work out with a calculator that it is = but there is a fairly simple trick for finding out approximately how large a power of 2 is. It is based on the fact that 2 10 = 1024 = 10 3 Thus 2 32 = = 4 (2 10 ) 3 = 4 (10 3 ) 3 = You can see that the answer is only approximate, but the method is fairly painless (if you are able to manipulate exponents). Integer format storage 1.6 Computers use binary to store everything, including numbers. For numbers, the system used for integers (that is whole numbers, with no fractional part) is simpler to explain than the common system for dealing with numbers that may have fractional parts. In general modern computers will use 32 bits to store each integer. (Sometimes, they use 64 but we will concentrate on a 32 bit system.) How are the bits used? Take a simple example like 9. First write that in binary 9 = (1001) 2 and that only has 4 digits. We could seemingly manage by using only 4 bits (where we make them on, off, off, on) and it seems a waste to use 32 bits. However, if you think about it you can see that we would need to also record how many bits we needed each time. Generally it is simpler to decide to use 32 bits from the start. For this number 9 we can pad it out by putting zeros in front 9 = (1001) 2 = ( ) 2 and then we end up filling our row of 32 bits like this: Bit position: One practical aspect of this system is that it places a limit on the maximum size of the integers we can store. Since we allocate 32 bits we have a total of 2 32 = different settings and so we have room for only that many different integers. So we could fit in all the integers from 0 to , but that is usually not such a good strategy because we may also want to allow room for negative integers. If we don t especially favour positive integers over negative ones, that leaves us with space to store the integers from about 2 31 to To be precise, that would be = numbers if we include zero and so we would have to leave out either ±2 31.

6 Mathematics 1S3 (Timoney) for addition and subtraction of these bigger integers. So you will not simply be able to use the ordinary plus and times that you can use with regular integers. Floating point format storage 1.7 In order to cope with numbers that are allowed to have fractional parts, computers use a binary version of the usual decimal point. Perhaps we should call it a binary point as decimal refers to base 10. Recall that what we mean by digits after the decimal point has to do with multiples of 1/10, 1/100 = 1/10 2 = 10 2, etc. So the number means = We use the binary point in the same way with powers of 1/2. So ( ) 2 = As in the familiar decimal system, every number can be written as a binary decimal. (Well that is a contradictory statement. Really we should say we can write every number in binary using a binary point.) As in decimal, there can sometimes be infinitely many digits after the point. What we do next is use a binary version of scientific notation. (You will see the ordinary decimal scientific notation on your calculator at times, when big numbers are written with an E.) The usual decimal scientific notation is like this = We refer to the part (a number between 1 and 10 or between -1 and -10 for negative numbers) as the mantissa. The power (in this case the 4) is called the exponent. Another decimal example is = and here the mantissa is while the exponent is 3. This is all based on the fact that multiplying or dividing by powers of 10 simply moves the decimal point around. In binary, what happens is that multiplying or dividing by powers of 2 moves the binary point. (101) 2 = (10.1) 2 = = (101) ( ) 2 = ( ) This last is an example of a number in the binary version of scientific notation. The mantissa is ( ) 2 and we can always arrange (no matter what number we are dealing with) to have the mantissa between 1 and 2. In fact always less than 2, and so beginning with 1. something always. For negative numbers we would need a minus sign in front. The exponent in this last example is 3 (the power that goes on the 2).

7 Binary, octal and hexadecimal numbers 7 What we do then is write every number in this binary version of scientific notation. That saves us from having to record where to put the binary point, because it is always in the same place. Or really, the exponent tells us how far to move the point from that standard place. Computers then normally allocate a fixed number of bits for storing such numbers. The usual default is to allocate 32 bits in total (though 64 is quite common also). Within the 32 bits they have to store the mantissa and the exponent. Computers do everything in binary. The mantissa is already in binary, but we also need the exponent in binary. So in the last example the mantissa is +( ) 2 while the exponent is 3 = (11) 2. Computers usually allocate 24 bits for storing the mantissa (including its possible sign) and the remaining 8 bits for the exponent. In our little example, 24 bits is plenty for the mantissa and we would need to make it longer to fill up the 24 bits: ( ) 2 will be the same as ( ) 2. However, there are numbers that need more than 24 binary digits in the mantissa, and what we must then do is round off. In fact, since we normally want to keep one spot for a possible sign, we have to chop off the mantissa after 23 binary digits (or more usually we will round up or down depending on whether the digit in the next place is 1 or 0). Filling out example number ( ) into 32 bits using this system, we might get this: Bit position: We are keeping bit 1 for a possible sign on the mantissa and we also need to allow the possibility of negative exponents. For example ( ) 2 = (1.11) is negative and so has a negative mantissa (1.11) 2. Because it is less than 1 in absolute value, it also has a negative exponent 4 = (100) 2. To be a bit more accurate about how computers really do things, they normally put the sign bit (of the mantissa) first (or in their idea of the most prominent place), then but the 8 bits of the exponent next and the remaining 23 bits of the mantissa at the end. So a better picture for ( ) is this: ± exponent mantissa less sign This is just explained for the sake of greater accuracy but is not our main concern. The method we have sketched is called single precision floating point storage. There are some details we have not gone into here (such as how to store 0). Another common method, called double precision, uses 64 bits to store each number, 53 for the mantissa and 11 for the exponent. Limitations of floating point 1.8 Apart from the information about how the computer uses binary to store these floating point numbers 1 we can get an idea of the scope and accuracy that this system allows. 1 the words indicate that the position of the binary point is movable, controlled by the exponent

8 Mathematics 1S3 (Timoney) The largest possible number we can store has mantissa ( ) 2 (with the maximum possible number of 1 s) and exponent as large as possible. Now ( ) 2 (with 23 1 s) is just about 2 and the largest possible exponent is = 127. [We are allowed 8 bits for the exponent, which gives us room for 2 8 = 256 different exponents. About half should be negative, and we need room for zero. So that means we can deal with exponents from 128 to +127.] Thus our largest floating point number is about = This is quite a big number and we can estimate it by using the 2 10 = 10 3 idea = = 256 (2 10 ) 12 = 256 (10 3 ) 12 = = This is quite a bit larger than the limit of around we had with integers. Indeed it is large enough for most ordinary purposes. We can also find the smallest positive number that we can store. It will have the smallest possible mantissa (1.0) 2 and the most negative possible exponent, 128. So it is = = = = Again this is pretty tiny. If we use double precision (64 bits per number, requires twice as much computer memory per number) we get an exponent range from 2 10 = 1024 to = The largest possible number is = = 16 (2 10 ) 102 = 16 (10 3 ) 102 = and the smallest is the reciprocal of this. In both single and double precision, we have the same range of sizes for negative numbers as we have for positive numbers. So the limitation on size are not severe limitations, but the key consideration is the limit on the accuracy of the mantissa imposed by the 24 bit limit (or the 53 bit limit for double precision). We will return to this point later on, but the difficulty is essentially not with the smallest number we can store but with the next biggest number greater than 1 we can store. That number has exponent 0 and mantissa ( ) 2 where we put in as many zeros as we can fit before the final 1. Allowing 1 sign bit, we have 23 places in total and so we fit 21 zeros. That means the number is = = (2 10 ) = = A consequence of this is that we cannot add a very small number to 1 and get an accurate answer, even though we can keep track of both the 1 and the very small number fine. For example the small number could be 2 24 or 2 75 ), but we would be forced to round 1+ either of those numbers to 1.

9 Binary, octal and hexadecimal numbers 9 We can get a similar problem with numbers of different magnitude than 1. If we look at the problem relative to the size of the correct result, we get a concept called relative error for a quantity. We will come back to this later, but the idea is that an error should not be considered in the abstract. [An error of 1 milimetre may seem small, and it would be quite small if the total magnitude of the quantity concerned was 1 kilometre. Even if the total magnitude was 1 metre, 1 milimetre may well be not so significant, depending on the context. But if the measurement is for the diameter of a needle, then a 1 milimetre error could be huge.] Another way to look at the idea of a relative error will be to consider the number of significant figures in a quantity. What happens with single precision floating point numbers is that we have at most 23 significant binary digits. When translated into decimal, this means 6 or 7 significant digits. That means that a computer program that prints an answer should normally not be trusted completely in the units place. (The 7 may or may not be entirely right and the.89 are almost certainly of no consequence.) That is even in the best possible case. There may also be more significant errors along the way in a calculation that could affect the answer more drastically. If a computer works in double precision, then there is a chance of more significant digits. In double precision, the next number after 1 is = and we can get about 15 accurate digits (if all goes well). Converting Octal or Hex to binary 1.9 We did already discuss some conversions of integers between different bases. There is a method based on repeated division and keeping track of remainders. We can use this to convert from decimal to octal, to hex, or to binary. If we write out the formula corresponding to a number in binary, octal or hex, we can compute the number in decimal by evaluating the formula. These methods involve quite a bit of work, especially if the number is large. However there is a very simple way to convert between octal and binary. It is based on the fact that 8 = 2 3 is a power of 2 and so it is very easy to convert base 8 to base 2. (541) 8 = = ( ) (1 2 2 ) = = ( ) 2 If we look at how this works, it basically means that we can convert from octal to binary by converting each octal digit to binary separately but we must write each digit as a 3 digit binary number. Redoing the above example that way we have 5 = (101) 2 (uses 3 digits anyhow), 4 = (100) 2 (again uses 3 digits) and 1 = (1) 2 = (001) 2 (here we have to force ourselves to use up 3 digits) and we can say (541) 8 = ( ) 2 = ( ) 2 This method works with any number of octal digits and we never have to really convert anything but the 8 digits 0-7 to binary. It is also reversible. We can convert any binary number to

10 Mathematics 1S3 (Timoney) octal very quickly if we just group the digits in 3 s starting from the units. For example ( ) 2 = ( ) 2 = (172413) 8 A similar method works for converting between binary and hex, except that now the rule is 4 binary digits for each hex digit. It all works because 16 = 2 4. For example Or going in reverse (a539) 16 = ( ) 2 = ( ) 2 ( ) 2 = ( ) 2 = (f50b) 16 We can use these ideas to convert octal to hex or vice versa by going via binary. We never actually have to convert any number bigger than 15. If we wanted to convert a number such as 5071 to binary, it may be easier to find the octal representation (by repeatedly dividing by 8 and keeping track of all remainders) and then converting to binary at the end via the 3 binary digits for one octal rule = remainder = 79 + remainder = 9 + remainder = 1 + remainder = 0 + remainder 1 (5071) 10 = (11717) 8 = ( ) 2 = ( ) 2 = ( ) 2 We can now explain why computer people are fond of base 16 or hex. Octal looks easier to read (no need to worry about the new digits a for ten, etc) but in computers we are frequently considering 32 bits at a time. Using the 3 binary for one octal rule, this allows us to write out the 32 bits quickly, but it takes us eleven octal digits. The messy part is that we really don t quite use the eleventh octal digit fully. It can be at most (11) 2 = 3. With hex, we have a 4 binary digits for one hex rule and 32 binary digits or bits exactly uses up 8 hex digits. Computers use binary for everything, not just numbers. For example, text is encoded in binary by numbering all the letters and symbols. The most well used method for doing this is called ASCII (an acronym that stands for American Standard Code for Information Interchange).

11 Binary, octal and hexadecimal numbers 11 and it uses 7 binary digits or bits for each letter. You may be surprised that there are 2 7 = 128 letters, as there seem to be only 26 normally. But if you think a little you will see that there are 52 if you count upper and lower case separately. Moreover there are punctuation marks that you will see on your computer keyboard like!,.? / # [ ] { } ( ) * & ˆ % \$ and we also need to keep track of the digits 0-9 as symbols (separately to keeping track of the numerical values). Finally the ASCII code allocates numbers or bit patterns to some invisible things like space, tab, new line and in the end 127 is just barely enough. On a UNIX system, you can find out what the ASCII code is by typing the command man ascii at the command line prompt. Here is what you will see: ASCII(7) FreeBSD Miscellaneous Information Manual ASCII(7) NAME ascii - octal, hexadecimal and decimal ASCII character sets DESCRIPTION The octal set: 000 nul 001 soh 002 stx 003 etx 004 eot 005 enq 006 ack 007 bel 010 bs 011 ht 012 nl 013 vt 014 np 015 cr 016 so 017 si 020 dle 021 dc1 022 dc2 023 dc3 024 dc4 025 nak 026 syn 027 etb 030 can 031 em 032 sub 033 esc 034 fs 035 gs 036 rs 037 us 040 sp 041! 042 " 043 # 044 \$ 045 % 046 & ( 051 ) 052 * , / : 073 ; 074 < 075 = 076 > 077? 101 A 102 B 103 C 104 D 105 E 106 F 107 G 110 H 111 I 112 J 113 K 114 L 115 M 116 N 117 O 120 P 121 Q 122 R 123 S 124 T 125 U 126 V 127 W 130 X 131 Y 132 Z 133 [ 134 \ 135 ] 136 ˆ 137 _ a 142 b 143 c 144 d 145 e 146 f 147 g 150 h 151 i 152 j 153 k 154 l 155 m 156 n 157 o 160 p 161 q 162 r 163 s 164 t 165 u 166 v 167 w 170 x 171 y 172 z 173 { } del The hexadecimal set: 00 nul 01 soh 02 stx 03 etx 04 eot 05 enq 06 ack 07 bel 08 bs 09 ht 0a nl 0b vt 0c np 0d cr 0e so 0f si 10 dle 11 dc1 12 dc2 13 dc3 14 dc4 15 nak 16 syn 17 etb 18 can 19 em 1a sub 1b esc 1c fs 1d gs 1e rs 1f us 20 sp 21! 22 " 23 # 24 \$ 25 % 26 & ( 29 ) 2a * 2b + 2c, 2d - 2e. 2f / a : 3b ; 3c < 3d = 3e > 3f? 41 A 42 B 43 C 44 D 45 E 46 F 47 G 48 H 49 I 4a J 4b K 4c L 4d M 4e N 4f O 50 P 51 Q 52 R 53 S 54 T 55 U 56 V 57 W 58 X 59 Y 5a Z 5b [ 5c \ 5d ] 5e ˆ 5f _ a 62 b 63 c 64 d 65 e 66 f 67 g 68 h 69 i 6a j 6b k 6c l 6d m 6e n 6f o 70 p 71 q 72 r 73 s 74 t 75 u 76 v 77 w 78 x 79 y 7a z 7b { 7c 7d } 7e 7f del

12 Mathematics 1S3 (Timoney) The decimal set: 0 nul 1 soh 2 stx 3 etx 4 eot 5 enq 6 ack 7 bel 8 bs 9 ht 10 nl 11 vt 12 np 13 cr 14 so 15 si 16 dle 17 dc1 18 dc2 19 dc3 20 dc4 21 nak 22 syn 23 etb 24 can 25 em 26 sub 27 esc 28 fs 29 gs 30 rs 31 us 32 sp 33! 34 " 35 # 36 \$ 37 % 38 & ( 41 ) 42 * , / : 59 ; 60 < 61 = 62 > 63? 65 A 66 B 67 C 68 D 69 E 70 F 71 G 72 H 73 I 74 J 75 K 76 L 77 M 78 N 79 O 80 P 81 Q 82 R 83 S 84 T 85 U 86 V 87 W 88 X 89 Y 90 Z 91 [ 92 \ 93 ] 94 ˆ 95 _ a 98 b 99 c 100 d 101 e 102 f 103 g 104 h 105 i 106 j 107 k 108 l 109 m 110 n 111 o 112 p 113 q 114 r 115 s 116 t 117 u 118 v 119 w 120 x 121 y 122 z 123 { } del FILES /usr/share/misc/ascii HISTORY An ascii manual page appeared in Version 7 AT&T UNIX. BSD June 5, 1993 I certainly would not try to remember this, but you can see that the symbol A (capital A) is given a code (101) 8 = (41) 16 = (65) 10 and that the rest of the capital letters follow A in the usual order. This means that A uses the 7 bits in ASCII but computers almost invariably allocate 8 bits to store each letter. They sometimes differ about what they do with the wasted 8th bit, but the extra bit allows space for 2 8 = 256 letters while ASCII only specifies 128 different codes. If you think about it you will see that there are no codes for accented letters like á or è (which you might need in Irish or French), no codes for the Greek or Russian letters, no codes for Arabic or Hindu. In fact 8 bits (or 256 total symbols) is nowhere near enough to cope with all the alphabets of the World. That is a reflection of the fact that ASCII goes back to the early days of computers when memory was relatively very scarce compared to now, and also when the computer industry was mostly American. The modern system (not yet universally used) is called UNICODE and it allocates 16 bits for each character. Even with 2 16 = possible codes, there is a difficulty accommodating all the worlds writing systems (including Chinese, Japanese, mathematical symbols, etc). Converting fractions to binary 1.10 We now look at a way to convert fractions to binary. We already that mentioned that in principle every real number, including fractions, can be represented as a binary decimal (or really using a binary point ). We have already looked into whole numbers fairly extensively and what remains to do is to explain a practical way to find the binary digits for a fraction. You see if we start with (say 34 we can say that is We know = (110) 2 and if we could work out how to represent 4 as 0. something in binary then we would 5 have 34 = = (110. something) To work out what something should be we work backwards from the answer. We can t exactly do that without having the answer, but we can proceed as we do in algebra by writing

13 Binary, octal and hexadecimal numbers 13 down the unknown digits. Later we will work them out. Say the digits we want are b 1, b 2, b 3,... and so 4 5 = (0.b 1b 2 b 3 b 4 ) 2 We don t know any of b 1, b 2, b 3,... yet but we know they should be base 2 digits and so each one is either 0 or 1. We can write the above equation as a formula and we have If we multiply both sides by 2, we get 4 5 = b b b b = b 1 + b b b In other words multiplying by 2 just moves the binary point and we have 8 5 = (b 1.b 2 b 3 b 4 ) 2 Now if we take the whole number part of both sides we get 1 on the left and b 1 on the right. So we must have b 1 = 1. But if we take the fractional parts of both sides we have 3 5 = (0.b 2b 3 b 4 ) 2 We are now in a similar situation to where we began (but not with the same fraction) and we can repeat the trick we just did. Double both sides again 6 5 = (b 2.b 3 b 4 b 5 ) 2 Take whole number parts of both sides: b 2 = 1. Take fractional parts of both sides. 1 5 = (0.b 3b 4 b 5 ) 2 We can repeat our trick as often as we want to uncover as many of the values b 1, b 2, b 3, etc as we have the patience to discover. What we have is a method, in fact a repetitive method where we repeat similar instructions many times. We call a method like this an algorithm, and this kind of thing is quite easy to programme on a computer because one of the programming instructions in almost any computer language is REPEAT (meaning repeat a certain sequence of steps from where you left off the last time). In this case we can go a few more times through the steps to see how we get on. Double both sides again. 2 5 = (b 3.b 4 b 5 b 6 ) 2

14 Mathematics 1S3 (Timoney) Whole number parts. b 3 = 0. Fractional parts Double both sides again. Whole number parts. b 4 = 0. Fractional parts 2 5 = (0.b 4b 5 b 6 ) = (b 4.b 5 b 6 b 7 ) = (0.b 5b 6 b 7 ) 2 This is getting monotonous, but you see the idea. You can get as many of the b s as you like. But, if you look more carefully, you will see that it has now reached repetition and not just monotony. We are back to the same fraction as we began with 4. If we compare the last equation 5 to the starting one 4 5 = (0.b 1b 2 b 3 b 4 ) 2 we realise that everything will unfold again exactly as before. We must find b 5 = b 1 = 1, b 6 = b 2 = 1, b 7 = b 3 = 0, b 8 = b 4 = 0, b 9 = b 5 = b 1 and so we have a repeating pattern of digits So we can write the binary expansion of 4 down fully as a repeating pattern 5 and our original number as 4 5 = (0.1100) = ( ) 2 Sample exam questions June 2000 (a) Write out the four (base 10) numbers 3, 7, 19, 31 in binary and explain how a modern computer might use 32 bits to store these numbers. (b) Convert the hexadecimal number (c14b) 16 to octal by first converting it to binary via the 4 binary for one hexadecimal rule and then using a similar rule to convert to octal. (c) Convert 29/5 to binary. Then convert the binary result to scientific notation and give the (binary) mantissa and exponent for it. June 2001 (a) Write out the four (base 10) numbers 5, 10, 19, 35 in binary. Explain how a modern computer might use 32 bits to store 10 and 19 (base ten) as integer numbers.

15 Binary, octal and hexadecimal numbers 15 If the number 10 (base ten) was stored as a floating point (single precision) number instead of as an integer, how might the 32 bits then be allocated? If using single precision floating point format, what would be the largest and smallest positive number that could be stored? (Explain your reasoning.) Explain the rough magnitude of these numbers as powers of ten. (b) Convert the octal number (15217) 8 to hexadecimal by first converting it to binary via the 3 binary for one octal rule and then using a similar rule to convert to hexadecimal. (c) Convert 29/11 to binary. October 22, 2005

Chapter 5. Binary, octal and hexadecimal numbers

Chapter 5. Binary, octal and hexadecimal numbers A place to look for some of this material is the Wikipedia page http://en.wikipedia.org/wiki/binary_numeral_system#counting_in_binary Another place that

plc numbers - 13.1 Encoded values; BCD and ASCII Error detection; parity, gray code and checksums

plc numbers - 3. Topics: Number bases; binary, octal, decimal, hexadecimal Binary calculations; s compliments, addition, subtraction and Boolean operations Encoded values; BCD and ASCII Error detection;

Memory is implemented as an array of electronic switches

Memory Structure Memory is implemented as an array of electronic switches Each switch can be in one of two states 0 or 1, on or off, true or false, purple or gold, sitting or standing BInary digits (bits)

Numeral Systems. The number twenty-five can be represented in many ways: Decimal system (base 10): 25 Roman numerals:

Numeral Systems Which number is larger? 25 8 We need to distinguish between numbers and the symbols that represent them, called numerals. The number 25 is larger than 8, but the numeral 8 above is larger

Binary Number System. 16. Binary Numbers. Base 10 digits: 0 1 2 3 4 5 6 7 8 9. Base 2 digits: 0 1

Binary Number System 1 Base 10 digits: 0 1 2 3 4 5 6 7 8 9 Base 2 digits: 0 1 Recall that in base 10, the digits of a number are just coefficients of powers of the base (10): 417 = 4 * 10 2 + 1 * 10 1

ASCII Code. Numerous codes were invented, including Émile Baudot's code (known as Baudot

ASCII Code Data coding Morse code was the first code used for long-distance communication. Samuel F.B. Morse invented it in 1844. This code is made up of dots and dashes (a sort of binary code). It was

This is great when speed is important and relatively few words are necessary, but Max would be a terrible language for writing a text editor.

Dealing With ASCII ASCII, of course, is the numeric representation of letters used in most computers. In ASCII, there is a number for each character in a message. Max does not use ACSII very much. In the

Base Conversion written by Cathy Saxton

Base Conversion written by Cathy Saxton 1. Base 10 In base 10, the digits, from right to left, specify the 1 s, 10 s, 100 s, 1000 s, etc. These are powers of 10 (10 x ): 10 0 = 1, 10 1 = 10, 10 2 = 100,

The ASCII Character Set

The ASCII Character Set The American Standard Code for Information Interchange or ASCII assigns values between 0 and 255 for upper and lower case letters, numeric digits, punctuation marks and other symbols.

Encoding Text with a Small Alphabet

Chapter 2 Encoding Text with a Small Alphabet Given the nature of the Internet, we can break the process of understanding how information is transmitted into two components. First, we have to figure out

Systems I: Computer Organization and Architecture

Systems I: Computer Organization and Architecture Lecture 2: Number Systems and Arithmetic Number Systems - Base The number system that we use is base : 734 = + 7 + 3 + 4 = x + 7x + 3x + 4x = x 3 + 7x

NUMBER SYSTEMS. William Stallings

NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html

Oct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8

ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: -Our standard number system is base, also

CSI 333 Lecture 1 Number Systems

CSI 333 Lecture 1 Number Systems 1 1 / 23 Basics of Number Systems Ref: Appendix C of Deitel & Deitel. Weighted Positional Notation: 192 = 2 10 0 + 9 10 1 + 1 10 2 General: Digit sequence : d n 1 d n 2...

Xi2000 Series Configuration Guide

U.S. Default Settings Sequence Reset Scanner Xi2000 Series Configuration Guide Auto-Sense Mode ON UPC-A Convert to EAN-13 OFF UPC-E Lead Zero ON Save Changes POS-X, Inc. 2130 Grant St. Bellingham, WA 98225

Section 1.4 Place Value Systems of Numeration in Other Bases

Section.4 Place Value Systems of Numeration in Other Bases Other Bases The Hindu-Arabic system that is used in most of the world today is a positional value system with a base of ten. The simplest reason

The string of digits 101101 in the binary number system represents the quantity

Data Representation Section 3.1 Data Types Registers contain either data or control information Control information is a bit or group of bits used to specify the sequence of command signals needed for

Digital System Design Prof. D Roychoudhry Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Digital System Design Prof. D Roychoudhry Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 04 Digital Logic II May, I before starting the today s lecture

Symbols in subject lines. An in-depth look at symbols

An in-depth look at symbols What is the advantage of using symbols in subject lines? The age of personal emails has changed significantly due to the social media boom, and instead, people are receving

Chapter 1: Digital Systems and Binary Numbers

Chapter 1: Digital Systems and Binary Numbers Digital age and information age Digital computers general purposes many scientific, industrial and commercial applications Digital systems telephone switching

URL encoding uses hex code prefixed by %. Quoted Printable encoding uses hex code prefixed by =.

ASCII = American National Standard Code for Information Interchange ANSI X3.4 1986 (R1997) (PDF), ANSI INCITS 4 1986 (R1997) (Printed Edition) Coded Character Set 7 Bit American National Standard Code

6 3 4 9 = 6 10 + 3 10 + 4 10 + 9 10

Lesson The Binary Number System. Why Binary? The number system that you are familiar with, that you use every day, is the decimal number system, also commonly referred to as the base- system. When you

Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.

Unit 1 Number Sense In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions. BLM Three Types of Percent Problems (p L-34) is a summary BLM for the material

Useful Number Systems

Useful Number Systems Decimal Base = 10 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} Binary Base = 2 Digit Set = {0, 1} Octal Base = 8 = 2 3 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7} Hexadecimal Base = 16 = 2

Binary Representation. Number Systems. Base 10, Base 2, Base 16. Positional Notation. Conversion of Any Base to Decimal.

Binary Representation The basis of all digital data is binary representation. Binary - means two 1, 0 True, False Hot, Cold On, Off We must be able to handle more than just values for real world problems

Everything you wanted to know about using Hexadecimal and Octal Numbers in Visual Basic 6

Everything you wanted to know about using Hexadecimal and Octal Numbers in Visual Basic 6 Number Systems No course on programming would be complete without a discussion of the Hexadecimal (Hex) number

BAR CODE 39 ELFRING FONTS INC.

ELFRING FONTS INC. BAR CODE 39 This package includes 18 versions of a bar code 39 font in scalable TrueType and PostScript formats, a Windows utility, Bar39.exe, that helps you make bar codes, and Visual

Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 INTRODUCTION TO DIGITAL LOGIC

Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 1 Number Systems Representation Positive radix, positional number systems A number with radix r is represented by a string of digits: A n

Number Representation

Number Representation CS10001: Programming & Data Structures Pallab Dasgupta Professor, Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Topics to be Discussed How are numeric data

Numbering Systems. InThisAppendix...

G InThisAppendix... Introduction Binary Numbering System Hexadecimal Numbering System Octal Numbering System Binary Coded Decimal (BCD) Numbering System Real (Floating Point) Numbering System BCD/Binary/Decimal/Hex/Octal

Exponents and Radicals (a + b) 10 Exponents are a very important part of algebra. An exponent is just a convenient way of writing repeated multiplications of the same number. Radicals involve the use of

BARCODE READER V 2.1 EN USER MANUAL

BARCODE READER V 2.1 EN USER MANUAL INSTALLATION OF YOUR DEVICE PS-2 Connection RS-232 Connection (need 5Volts power supply) 1 INSTALLATION OF YOUR DEVICE USB Connection 2 USING THIS MANUAL TO SETUP YOUR

Computer Science 281 Binary and Hexadecimal Review

Computer Science 281 Binary and Hexadecimal Review 1 The Binary Number System Computers store everything, both instructions and data, by using many, many transistors, each of which can be in one of two

DEBT COLLECTION SYSTEM ACCOUNT SUBMISSION FILE

CAPITAL RESOLVE LTD. DEBT COLLECTION SYSTEM ACCOUNT SUBMISSION FILE (DCS-ASF1107-7a) For further technical support, please contact Clive Hudson (IT Dept.), 01386 421995 13/02/2012 Account Submission File

Voyager 9520/40 Voyager GS9590 Eclipse 5145

Voyager 9520/40 Voyager GS9590 Eclipse 5145 Quick Start Guide Aller à www.honeywellaidc.com pour le français. Vai a www.honeywellaidc.com per l'italiano. Gehe zu www.honeywellaidc.com für Deutsch. Ir a

CS321. Introduction to Numerical Methods

CS3 Introduction to Numerical Methods Lecture Number Representations and Errors Professor Jun Zhang Department of Computer Science University of Kentucky Lexington, KY 40506-0633 August 7, 05 Number in

BI-300. Barcode configuration and commands Manual

BI-300 Barcode configuration and commands Manual 1. Introduction This instruction manual is designed to set-up bar code scanner particularly to optimize the function of BI-300 bar code scanner. Terminal

1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal:

Exercises 1 - number representations Questions 1. Give the 16 bit signed (twos complement) representation of the following decimal numbers, and convert to hexadecimal: (a) 3012 (b) - 435 2. For each of

Decimals and other fractions

Chapter 2 Decimals and other fractions How to deal with the bits and pieces When drugs come from the manufacturer they are in doses to suit most adult patients. However, many of your patients will be very

CHAPTER 5 Round-off errors

CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any

Grade 6 Math Circles. Binary and Beyond

Faculty of Mathematics Waterloo, Ontario N2L 3G1 The Decimal System Grade 6 Math Circles October 15/16, 2013 Binary and Beyond The cool reality is that we learn to count in only one of many possible number

47 Numerator Denominator

JH WEEKLIES ISSUE #22 2012-2013 Mathematics Fractions Mathematicians often have to deal with numbers that are not whole numbers (1, 2, 3 etc.). The preferred way to represent these partial numbers (rational

2 Number Systems. Source: Foundations of Computer Science Cengage Learning. Objectives After studying this chapter, the student should be able to:

2 Number Systems 2.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Understand the concept of number systems. Distinguish

Guidance paper - The use of calculators in the teaching and learning of mathematics

Guidance paper - The use of calculators in the teaching and learning of mathematics Background and context In mathematics, the calculator can be an effective teaching and learning resource in the primary

Direct Translation is the process of translating English words and phrases into numbers, mathematical symbols, expressions, and equations.

Section 1 Mathematics has a language all its own. In order to be able to solve many types of word problems, we need to be able to translate the English Language into Math Language. is the process of translating

Pre-Algebra Lecture 6

Pre-Algebra Lecture 6 Today we will discuss Decimals and Percentages. Outline: 1. Decimals 2. Ordering Decimals 3. Rounding Decimals 4. Adding and subtracting Decimals 5. Multiplying and Dividing Decimals

CHAPTER 8 BAR CODE CONTROL

CHAPTER 8 BAR CODE CONTROL CHAPTER 8 BAR CODE CONTROL - 1 CONTENTS 1. INTRODUCTION...3 2. PRINT BAR CODES OR EXPANDED CHARACTERS... 4 3. DEFINITION OF PARAMETERS... 5 3.1. Bar Code Mode... 5 3.2. Bar Code

Working with whole numbers

1 CHAPTER 1 Working with whole numbers In this chapter you will revise earlier work on: addition and subtraction without a calculator multiplication and division without a calculator using positive and

Binary Division. Decimal Division. Hardware for Binary Division. Simple 16-bit Divider Circuit

Decimal Division Remember 4th grade long division? 43 // quotient 12 521 // divisor dividend -480 41-36 5 // remainder Shift divisor left (multiply by 10) until MSB lines up with dividend s Repeat until

Digital Logic Design. Introduction

Digital Logic Design Introduction A digital computer stores data in terms of digits (numbers) and proceeds in discrete steps from one state to the next. The states of a digital computer typically involve

Preliminary Mathematics

Preliminary Mathematics The purpose of this document is to provide you with a refresher over some topics that will be essential for what we do in this class. We will begin with fractions, decimals, and

This Unit: Floating Point Arithmetic. CIS 371 Computer Organization and Design. Readings. Floating Point (FP) Numbers

This Unit: Floating Point Arithmetic CIS 371 Computer Organization and Design Unit 7: Floating Point App App App System software Mem CPU I/O Formats Precision and range IEEE 754 standard Operations Addition

APPENDIX C The Hexadecimal Number System and Memory Addressing U nderstanding the number system and the coding system that computers use to store data and communicate with each other is fundamental to

Activity 1: Using base ten blocks to model operations on decimals

Rational Numbers 9: Decimal Form of Rational Numbers Objectives To use base ten blocks to model operations on decimal numbers To review the algorithms for addition, subtraction, multiplication and division

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about

Number Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi)

Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi) INTRODUCTION System- A number system defines a set of values to represent quantity. We talk about the number of people

5.1 Radical Notation and Rational Exponents

Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

Unsigned Conversions from Decimal or to Decimal and other Number Systems

Page 1 of 5 Unsigned Conversions from Decimal or to Decimal and other Number Systems In all digital design, analysis, troubleshooting, and repair you will be working with binary numbers (or base 2). It

ESPA 4.4.4 Nov 1984 PROPOSAL FOR SERIAL DATA INTERFACE FOR PAGING EQUIPMENT CONTENTS 1. INTRODUCTION 2. CHARACTER DESCRIPTION

PROPOSAL FOR SERIAL DATA INTERFACE FOR PAGING EQUIPMENT CONTENTS 1. INTRODUCTION 2. CHARACTER DESCRIPTION 2.1 CHARACTER STRUCTURE 2.2 THE CHARACTER SET 2.3 CONTROL CHARACTERS 2.3.1 Transmission control

ASCII CODES WITH GREEK CHARACTERS

ASCII CODES WITH GREEK CHARACTERS Dec Hex Char Description 0 0 NUL (Null) 1 1 SOH (Start of Header) 2 2 STX (Start of Text) 3 3 ETX (End of Text) 4 4 EOT (End of Transmission) 5 5 ENQ (Enquiry) 6 6 ACK

6 The Hindu-Arabic System (800 BC)

6 The Hindu-Arabic System (800 BC) Today the most universally used system of numeration is the Hindu-Arabic system, also known as the decimal system or base ten system. The system was named for the Indian

NUMBER SYSTEMS. 1.1 Introduction

NUMBER SYSTEMS 1.1 Introduction There are several number systems which we normally use, such as decimal, binary, octal, hexadecimal, etc. Amongst them we are most familiar with the decimal number system.

2011, The McGraw-Hill Companies, Inc. Chapter 3

Chapter 3 3.1 Decimal System The radix or base of a number system determines the total number of different symbols or digits used by that system. The decimal system has a base of 10 with the digits 0 through

Addition Methods. Methods Jottings Expanded Compact Examples 8 + 7 = 15

Addition Methods Methods Jottings Expanded Compact Examples 8 + 7 = 15 48 + 36 = 84 or: Write the numbers in columns. Adding the tens first: 47 + 76 110 13 123 Adding the units first: 47 + 76 13 110 123

Welcome to Basic Math Skills!

Basic Math Skills Welcome to Basic Math Skills! Most students find the math sections to be the most difficult. Basic Math Skills was designed to give you a refresher on the basics of math. There are lots

LSN 2 Number Systems. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

LSN 2 Number Systems Department of Engineering Technology LSN 2 Decimal Number System Decimal number system has 10 digits (0-9) Base 10 weighting system... 10 5 10 4 10 3 10 2 10 1 10 0. 10-1 10-2 10-3

Computers. Hardware. The Central Processing Unit (CPU) CMPT 125: Lecture 1: Understanding the Computer

Computers CMPT 125: Lecture 1: Understanding the Computer Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 3, 2009 A computer performs 2 basic functions: 1.

Decimal Notations for Fractions Number and Operations Fractions /4.NF

Decimal Notations for Fractions Number and Operations Fractions /4.NF Domain: Cluster: Standard: 4.NF Number and Operations Fractions Understand decimal notation for fractions, and compare decimal fractions.

Create!form Barcodes. User Guide

Create!form Barcodes User Guide Barcodes User Guide Version 6.3 Copyright Bottomline Technologies, Inc. 2008. All Rights Reserved Printed in the United States of America Information in this document is

Seriously Simple Sums! Vedic Maths Free Tutorial. Maths Tips and Tricks to Improve Your Math Abilities

Copyright Notice This e-book is free! Maths Tips and Tricks to Improve Your Math Abilities This publication is protected by international copyright laws. You have the author s permission to transmit this

A Short Guide to Significant Figures

A Short Guide to Significant Figures Quick Reference Section Here are the basic rules for significant figures - read the full text of this guide to gain a complete understanding of what these rules really

Chapter 4: Computer Codes

Slide 1/30 Learning Objectives In this chapter you will learn about: Computer data Computer codes: representation of data in binary Most commonly used computer codes Collating sequence 36 Slide 2/30 Data

Sequences. A sequence is a list of numbers, or a pattern, which obeys a rule.

Sequences A sequence is a list of numbers, or a pattern, which obeys a rule. Each number in a sequence is called a term. ie the fourth term of the sequence 2, 4, 6, 8, 10, 12... is 8, because it is the

Binary, Hexadecimal, Octal, and BCD Numbers

23CH_PHCalter_TMSETE_949118 23/2/2007 1:37 PM Page 1 Binary, Hexadecimal, Octal, and BCD Numbers OBJECTIVES When you have completed this chapter, you should be able to: Convert between binary and decimal

ASCII Characters. 146 CHAPTER 3 Information Representation. The sign bit is 1, so the number is negative. Converting to decimal gives

146 CHAPTER 3 Information Representation The sign bit is 1, so the number is negative. Converting to decimal gives 37A (hex) = 134 (dec) Notice that the hexadecimal number is not written with a negative

Binary Numbers Binary Octal Hexadecimal Binary Numbers COUNTING SYSTEMS UNLIMITED... Since you have been using the 10 different digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 all your life, you may wonder how

HOMEWORK # 2 SOLUTIO

HOMEWORK # 2 SOLUTIO Problem 1 (2 points) a. There are 313 characters in the Tamil language. If every character is to be encoded into a unique bit pattern, what is the minimum number of bits required to

Session 7 Fractions and Decimals

Key Terms in This Session Session 7 Fractions and Decimals Previously Introduced prime number rational numbers New in This Session period repeating decimal terminating decimal Introduction In this session,

Lies My Calculator and Computer Told Me

Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing

Maths Workshop for Parents 2. Fractions and Algebra

Maths Workshop for Parents 2 Fractions and Algebra What is a fraction? A fraction is a part of a whole. There are two numbers to every fraction: 2 7 Numerator Denominator 2 7 This is a proper (or common)

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

Command Emulator STAR Line Mode Command Specifications

Line Thermal Printer Command Emulator STAR Line Mode Command Specifications Revision 0.01 Star Micronics Co., Ltd. Special Products Division Table of Contents 1. Command Emulator 2 1-1) Command List 2

Solution for Homework 2

Solution for Homework 2 Problem 1 a. What is the minimum number of bits that are required to uniquely represent the characters of English alphabet? (Consider upper case characters alone) The number of

Unit 7 The Number System: Multiplying and Dividing Integers

Unit 7 The Number System: Multiplying and Dividing Integers Introduction In this unit, students will multiply and divide integers, and multiply positive and negative fractions by integers. Students will

Data Storage. Chapter 3. Objectives. 3-1 Data Types. Data Inside the Computer. After studying this chapter, students should be able to:

Chapter 3 Data Storage Objectives After studying this chapter, students should be able to: List five different data types used in a computer. Describe how integers are stored in a computer. Describe how

Charlesworth School Year Group Maths Targets

Charlesworth School Year Group Maths Targets Year One Maths Target Sheet Key Statement KS1 Maths Targets (Expected) These skills must be secure to move beyond expected. I can compare, describe and solve

Counting in base 10, 2 and 16

Counting in base 10, 2 and 16 1. Binary Numbers A super-important fact: (Nearly all) Computers store all information in the form of binary numbers. Numbers, characters, images, music files --- all of these

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

Count the Dots Binary Numbers

Activity 1 Count the Dots Binary Numbers Summary Data in computers is stored and transmitted as a series of zeros and ones. How can we represent words and numbers using just these two symbols? Curriculum

Chapter 7 Lab - Decimal, Binary, Octal, Hexadecimal Numbering Systems

Chapter 7 Lab - Decimal, Binary, Octal, Hexadecimal Numbering Systems This assignment is designed to familiarize you with different numbering systems, specifically: binary, octal, hexadecimal (and decimal)

The Subnet Training Guide

The Subnet Training Guide A Step By Step Guide on Understanding and Solving Subnetting Problems by Brendan Choi v25 easysubnetcom The Subnet Training Guide v25 easysubnetcom Chapter 1 Understanding IP

Lecture 11: Number Systems

Lecture 11: Number Systems Numeric Data Fixed point Integers (12, 345, 20567 etc) Real fractions (23.45, 23., 0.145 etc.) Floating point such as 23. 45 e 12 Basically an exponent representation Any number

2010/9/19. Binary number system. Binary numbers. Outline. Binary to decimal

2/9/9 Binary number system Computer (electronic) systems prefer binary numbers Binary number: represent a number in base-2 Binary numbers 2 3 + 7 + 5 Some terminology Bit: a binary digit ( or ) Hexadecimal

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

1.6 The Order of Operations

1.6 The Order of Operations Contents: Operations Grouping Symbols The Order of Operations Exponents and Negative Numbers Negative Square Roots Square Root of a Negative Number Order of Operations and Negative

Vieta s Formulas and the Identity Theorem

Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion