Data Representation and Boolean Logic 9.1 INTRODUCTION You must have heard that computers work on ones and zeroes, ie., ones and zeroes play a big role in how computers work. In other words, data inside the computer gets stored in digital form (0s and 1s). : Inside the computers, it’s all about wires and circuits which carry all the information. Now, the question arises as to how do you store or represent information using electricity? If it is a single wire, there exist two states, ON/OFF; Yes/No; True/False; 1/0, This ON and OFF together constitute a BIT which is the smallest piece of information a computer can store as shown in Fig. 9.1 Thus, if we use more wires, we get more bits with more Os and 1s; with more bits, we can represent more complex information as shown in the figure given below. or Ea [S wiRES Fig. 9.1: Data Representation inside a ComputerFS a = Fs Fy 5 & Different data stored in the computer may be of the following kinds: > Numeric data (0, 1, 2, .... 9) > Alphabetic data (A, B,C, smu Z). > Alphanumeric data—combination of any of the symbols (A, B, C, wmuZ), (0.1, 9), or > Special characters (+, -, Blank), etc. These kinds of data, be it alphabets, numbers, symbols, sound data or video data, are represented in terms of Os and 1s, in the computer. Each symbol is represented as a unique combination of Os and 1s. Digital computers represent data by means of an easily identified symbol called a digit. These digits can be represented in different types of number systems used in digital technology. This chapter deals with the types of number systems and their conversion from one form to another. 9.2 NUMBER SYSTEM umber systems are the technique to represent numbers in the — computersystem architecture. It is the way to represent a number in ir different forms. When this data is fed into the computer, it is converted _ into numeric format according to ASCII (American Standard Code for Information Interchange), where each type of data is represented by its nume 5 In general, we are familiar with the popular number system known as decimal number system in which 10 digits, namely 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 are used to represent any number. Similarly, in the field of computers, we deal with two binary digits known as 1 and | BINARY | 0 that represent the presence or absence of an electric pulse respectively. There | 9 | 4 are infinite ways to represent a number. Each digit in a number system depends upon the following: > The face value of the digit, ie,, the digit itself. > The base of the number system. > The position of the digit in the number. The four commonly associated number systems with modern computers and digital electronics are: decimal, binary, octal, and hexadecimal. |_CTM: Number systems are the technique to represent numbers in the computer system architecture. G digital representation, the number systems are classified into four fundamental types: |__Number Systems {Decimal Number System —_] b>{_ Binary Number System | fig.9.: lesan of mbar Sater 256> Deci al Number System @ecimal number system has only ten (10) digits from 0 to 9. It is the number system with base value 10 which means it has 10 digits to represent the daté)Every number (value) can be represented with 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9 in this number system. The representation of a decimal number is depicted in Fig. 9.3(a). | Decimal Point thousands tenths hundreds — hundredths tens (-thousandths ones ten-thousandths 4 5689.3417 Positional Values > 10710" qe t MsB Decimal LsB (Most Significant Bit) (Least Significant Bit) Fig. 9.3(a): Representation of Decimal Number System i > Binary Number System G Binary number system has only two digits that are 0 and 1. Every number (value) can be ly represented with 0 and 1 in this number system. The base of binary number system is 2 because it has only two digits,}The representation of a binary number is depicted in Fig 9.3(b) Pictorial representation of the binary number (10101.1101), is: al Positional Values oral Valves J oy le ae Pat pasa | rahao pt ofa | sft | 1 ce. ft } x ees Se eee ae se [ MsB (Least Significant Bit) “(Most Significant Bit) Fig. 9.3(b): Representation of Binary Number System > Octal Number System Q©ctal number system has only eight (8) digits from 0 to 7. Every number (value) can be represented with 0, 1, 2, 3, 4, 5, 6 and 7 in this number system. The base of octal number system is 8 because it has only 8 digits) LO ana Leuk(tal Numbering System | = MsB Decimal usB (Most Significant Bi (Least Significant Bit) Fig. 9.3(¢): Octal Number System > Hexadecimal Number System (CA Hexadecimal number system has sixteen (16) alphanumeric values from 0 to 9 and A to F, “Every number (value) can be represented with 0, 1, 2,3, 4,5, 6,7,8,9, A,B,C, D, Eand Fin this number system. The base of hexadecimal number system is 16 because it has 16 alphanumeric values. Here A is 10, B is 11, Cis 12, D is 13, Eis 14 and Fis 15. Pictorially, hexadecimal number (243.45), can be represented as: Positional Values N16 16" 16° 16" 16? eee | tl 7 wsB isB (Most Significant Bit) (Least Significant Bit) Fig. 9.3(d): Representation of Hexadecimal Number System Each number system has a base also called a Radix. A decimal number system is a system of base 10; binary is a system of base 2; octal is a system of base 8; and hexadecimal is a system of base 16. What are these varying bases? The answer lies in what happens when we count Pec ec ue Lureup to the maximum number that the numbering system allows. In base 10, we can count from 0 to 9, that is, 10 digits. & Table 9.1: Number Systems and their Symbols Binary 2 on Octal 8 0,1,2,3,4,5,6,7 Decimal 10 0,1,2,3,4,5,6,7,8,9 Hexadecimal 16 0,1,2,3,4,5,6,7,8,9, A,B,C, DEF where A= 10;B = 11;C = 12;D = 13; E 15 9.3cTYPES OF NUMBER SYSTEMS, In the previous topic, we have discussed the various number systems available to us for saving and retrieving the values stored inside a computer system. Normally, we use base 10 or decimal number system in our day-to-day life. But when computers came into operation, decimal representation was changed to binary system as it involves binary computation, Since binary involves a long chain of BITs which are difficult to remember, Octal and Hexadecimal system were developed as both these systems are much convenient and, hence, conversions between these number systems became mandatory which are being discussed below. Conversion of one number system to another is classified into the following three broader categoriess Binary Octal ao Decimal Number System to Other Base [for example, Decimal Number System to LZ Other Base to Decimal Number System {for example, Binary Number System to Decimal Number System] inary Number System] ther Base System to Another [for example, Binary Number System to Hexadecimal Number System] TM: (1) Left-most bit of a number is known as Most Significant Bit (MSB). (2) Right-most bit is known as Least Significant Bit (LSB). I's same for all number systems. Let us discuss these in detail, = FH 5 g Fy @Pee uetie 9.3.1 Decimal Number System to Other Base Poecimal number to Binary number Following steps are to be carried out to convert a Decimal number into its Binary equivalent: 1. For whole number 2. Write remainder values ©) (3. Forfractional number conversion, repeatedly from bottom to top. conversion, repeatedly | divide by 2 and record multiply the digit by 2, taken the remainder. from right of the decimal Step 1: Step 2: Step 3: Step 4: point until the fractional product is 0 or the fractional value is repeated, Divide the given decimal number by 2 and record its quotient Q, and remainder R,. Again divide the new quotient obtained from Step 1 by 2 and record the new quotient Q, and remainder R,. Repeat Step 1 and Step 2 until the quotient Q, becomes 0. Write all remainder values R, moving from bottom to top, ie., moving from most significant bit (MSB) to least significant bit (LSB). . For example, LZ Convert the Decimal number 125 into its Binary equivalent. we Remainder LSB 125 /2= 62 62/2=31 31/2=15 Learning Tip: To convert decimal 18/227 number into other number system, we write all remainder 7/223 values moving from bottom to 3/2=1 1/250 top. Answer: (1111101), Converting Decimal fraction into Binary Awhile converting decimal fraction into binary fraction, the procedure is to successively multiply the decimal fraction by the radix, i.e., 2, and follow the given algorithm. Step 1: Step 2: Step 3: Multiply successively each fractional value by 2. Write separately the integral part, which is to the left of the decimal point, and the fractional part, which is to the right of the decimal point. Multiply the fractional part again by 2 and record the new integral and fractional part. This procedure will continue until either the fractional part becomes 0 or is repeated.Step 4: Moving from top to bottom, ie,, from LSB to MSB, write all values of integers. For example, Convert (0:375),, Setp 1: Multiply 0.375 by 2.We get to binary fraction 0375x2 = 0.750 Setp 2: Multiply 0.750 again by 2. We get i Z " 0750%2 = 150 1 050 Setp 3: Repeat this step until fractional part becomes 0 or is repeated. koow2 - Setp 4: Stop multiplying fractional part by 2 as it is now 0.00, ‘Move from LSB to MSB and write all integer values (from top to bottom), the result is: (0.375),, = (0.011), 1 {60} —+ Fractional partis For example, 20s a zy Convert (105.15), t0 binary a ie Let us convert 105 first as shown alongside. el (205), = (1101001), a Let us convert (0.15), TZ Multiply 0.15 by 2 0.30 et Multiply 0.30 by 2 0.60 Mupiya6oy2 220 eee eer Multiply 0.20 by 2 0.40 other number system, we write Multiply 0.40 by 2 0.80 Sea se eae Multiply 0.80 by 2 1.60 Reading the integers from top to bottom (0.15),, = (0.001001), Final result (105.15), = (1101001.001001),. jal to Octal Method to convert a Decimal number into its Octal number: (1. For whole number (2. Waite remainder values from) (3. For fractional number conversion, repeatedly | bottom to top. © conversion, repeatedly divide by 8 and record the multiply by & until the fora | fractional produc is 0 ‘or the fractional value is, J repeated. eo ec cee Ld_Step 1: Divide the given decimal number by 8 and record its quotient Q, and remainder R,, “Step 2: Again divide the new quotient obtained from Step 1 by 8 and record the new quotient Q, and remainder R.. Step 3: Repeat Step 1 and Step 2 until quotient Q, becomes 0. Step 4: Write all remainder values Rn moving from bottom to top, ie, moving from most significant bit (MSB) to least significant bit (LSB). Example: Convert the Decimal number 125 into its Octal equivalent. 125 /8=15 Leaming Tip: For converting 15/8 decimal number into octal - number, we divide decimal fe number by 8 Answer: (125), = (175), Converting Decimal fraction into Octal Example: Convert 0.21875 into octal fraction. Multiply the given fraction by 8. Keep the integer in the product as it is and multiply the new fraction in the product by 8. Continue the process and read the integers in the products from top to bottom. Given fraction 0.21875 (0.21875 x 8 = 1.75000 .75000 (fraction) 1 (LSB) Therefore, (0.21875),, = (0.16), _Decimal into Hexadecimal Method to convert a Decimal number into its Hexadecimal equivalent: Atep 1: Divide the given decimal number by 16 and record its quotient Q, and remainder R, /Step 2: Again divide the new quotient obtained from Step 1 by 16 and record the new quotient Q, and remainder R,, Step 3: Repeat Step 1 and Step 2 until quotient Q, becomes 0. Step 4: Write all remainder values R, moving from bottom to top, i.e., moving from most significant bit (MSB) to least significant bit (LSB) ed Example: | Convert the Decimal number 300 into its Hexadecimal equivalent. 300/16 = 18 1240) 18/16 2 Learning Tip: For converting ieee ; decimal number into hexadecimal number, we divide decimal number Answer: (12C),, by 16. CasioConverting Decimal fraction into Hexadecimal ee ‘Snvert (0.75),, into hexadecimal. Multiply the given fraction by 16. Keep the integer in the product as it is and multiply the new fraction in the product by 16. Continue the process and read the integers in the products from top to bottom. Convert (0.03125), into hexadecimal fraction. Given fraction .03125 Multiply 0.03125 x 16 0.50000 (LSB) ‘Again multiply 0.50000 x 16 8,00000 8 (msB) ‘Stop multiplying fractional part by 16 as the fractional part is now 0. Move from LSB to MSB and write all integer values. The result is: (0.03125),, = (0.08),, 9.3.2 Other Base to Decimal Number System Method to convert Binary into Decimal: 1, Start at the right-most bit. s 2. Take that bit and multiply by 2° where nis the current position beginning at 0 and increasing Zz by 1 each time. This represents a power of two. 3. Sum each term of product until all bits have been used. Binary to Decimal “For example, > Convert the Binary number 101011 into its Decimal equivalent. 142408 2+ 142 40% DH 122 41% 2 32+0+8+0+2+1=(43),, > Convert the Binary number 1001 into its Decimal Learning Tip: For converting other base number into decimal number equivalent, each digit is multiplied with its respective positional weight and then added to get the desired result \ equivalent. 1*25+0* 240824192 8+0+0+1=(9),, Q. Convert Binary Number (100011), into Decimal Number. PRODUCT VALUES, 1 eon eee ayComputer Science with Python-XI By adding all these product values, we get =142404040432=35 Hence, (100011), = (35),, Binary fraction to Decimal EP “for example, Convert (11011.101), into decimal ge ge ahs 212A ive es ese onic 1x 2+ (1 « 2°)+ (0 x 22)+ (1 x 24} (1 2} (1 x 2) (0x 274 (1x29) 6+8+0+24+1+05+0+0.125 27.625)... (Octal into Decimal Method to convert Octal into Decimal: 1. Start at the right-most bit. 2. Take that bitand multiply by 8, where n is the current position beginning at 0 and increasing by 1 each time. This represents the power of 8 3. Total each of the product terms until all bits have been used, For example, Convert the Octal number 321 into its Decimal equivalent. 3°8+2*B'+1°8? 192 +16+1 Octal fraction into Decimal For example, Copvert (23.25), into decimal 4 BB st gt oieeg 2 is = (2 * BI) + (3 x 8°) + (2x 8) + (5 x 82) = 16 +3 +0.25 + 0.07812 = (19.32812),,, Hexadecimal into Decimal Method to convert Hexadecimal into Decimal: 1, Start at the right-most bit. 2, Take that bit and multiply by 16" where n is the current position beginning at 0 and increasing by 1 each time. This represents a power of 16. 3. Total each of the product terms until all bits have been used.For example, Convert the Hexadecimal number AB into its Decimal equivalent. = A * 16'+B* 16° =10*16'+11* 16" Hexadecimal fraction into Decimal Example: Convert (1E.8C),, into decimal. 16 16° 16" 167 aeaee (Hiern 4 = (1x 16")+ (14 « 16°)+ (8 x 16*)+ (12 « 167) = 16 +14 +0.5 + 0.04688 = (30.54688),,. 9.3.3 One Base into Other Base System Binary into Hexadecimal The hexadecimal number system uses the digits 0 to 9 and A, B,C, D, E, F . Method to convert a Binary number into its Hexadecimal equivalent is: We take a binary number in groups of four and use the appropriate hexadecimal digit in its place. We begin at the right-most 4 bits. If we are not able to form a group of four, insert 0s to the left until we get all groups of 4 bits each. Write the hexadecimal equivalent of each group. Repeat the steps until all groups have been converted. For example, > Convert the Binary number 1000101 into its Hexadecimal equivalent. 0100 0101. Note that we needed to insert a 0 to the left of 100. 4 5 Answer: (45), In case of a fractional binary number, form groups of four bits on each side of decimal point. Then replace each group by its corresponding hexadecimal number. For example, > Convert (11100.1010), into hexadecimal equivalent. 0001 1100 . 1010 1 Ga. A Answer: (1C.A),, PLO Lar)Q. Convert Binary Number (1001.11001), into its equivalent Hexadecimal Number. OREO ae Cae Divide into group of 4 bits tte Go) fer 1001 = 12° + 0x2? + 0x2 + 1x2°=8+0+0+1=9 1101 = 1x2? + 1x2? + 0x2" + 0x2°= 8 +4+0+0=12(C) 1000 = 1x2" + 0x2? + 0x2’ + 0x2°=8+0+0+0=8 Wus, (1001.11001), = Hexadecimal into Binary Method to convert a Hexadecimal number into its Binary equivalent is: Convert each digit of Hexadecimal number into its binary equivalent and write them in 4 bits. Then combine each 4-bit binary Number and that is the resulting answer. Example: x onvert the Hexadecimal number (10AF),, into its Binary equivalent. . iieeeea OFeeeaAEeec 0001 | 0000 | 1010 | 1111 Answer: (0001000010101111), Example: Convert the Hexadecimal number (A2F)., into its Binary equivalent. A 2 F 1010 | 0010 | 1111 Answer: (1010 0010 1111),. (Qhonvert the Hexadecimal Number (FACE.32),, into Binary Number, 7} ae] [A}—- 1 0 1 6 ¢}+—-[a] 1 [ele] e}—{a[ 1] 1] 0] fs}—+felela[a i—-fe Te] +[o] Hence, (FACE.32),, = (1111101011001110.00110010),. Binary into Octal and Octal into Binary ‘To convert Binary into Octal, as the octal system is a power of two (2°), we can take the bits into groups of 3 and represent each group as an octal digit. The steps are the same for the binary to hexadecimal conversions except we are dealing with the octal base now. CE cus ica Lule Lae° Aanen Zrt 1 aotre on, 2 on GQ ee as 4 a) > il aaa v0 @ ‘To convert from octal to binary, we simply represent each octal digit in its three-bit binary form as shown in the above figure. _AQ. Convert Binary Number (10110101.11001), ito Octal Number. Reuss ° po Divide into group of 3 bits bho] Pelle - { ~ Octal conversion of each group is: 010 = 0x2? +1x2'+0x Extra 0 bit Ur Peerrarr rrr oerers Extra 0 bit | added 101 =1x2?40X2'41x2°= 4404 added M02 1x2 +1x24Ox2=442+ 010 = 0x24 1x24 0% 2= 042+ ‘Thus, (10110101.11001), = (265.62), For example, > Convert the Octal number (742), into its Binary equivalent. 71412 111 | 100 | 010 (111100010), _SeConvert Octal Number (3.1), into its equivalent Binary Number. Answei To convert Hexadecimal into Octal, convert each digit of Hexadecimal number into its binary equivalent and write them in 4 bits. Then, combine each 3-1 converted into octal. binary number and that is Each digit of octal number is divided into a group of 3 bits. = Be}—~-(fo" [pe oe) § |_. oj ] | cy ha te Lees) | = Hence, (3-1),= (017.001), | 4 ’ Hexadecimal into Octal and Octal into Hexadecimal g s ry éComputer Science with Python-XI For example, > Convert the Hexadecimal number (A42),, into its Octal equivalent. Al4|2 1010 | 0100 | 0010 101 | 001 | 000 | 010 Answer: (5102), Q. Convert Hexadecimal number (A2DE),, into its equivalent Octal number. ri Split each hexadecimal digit into 4-bit binary number. Hexadecimal A | 2 D Binary 1010 0010-1101 | Combine all Binary digits Binary no.=|1 | 0 [ola Make group of 3 bits and write its octal equivalent. war [ot aT | 121336 | Hence, (121336), is the converted number. ‘To convert Octal into Hexadecimal, convert each digit of Octal number into its binary equivalent and write them in 3 bits. Then combine each 4-bit binary number and that is converted into hexadecimal. For example, > Convert the Octal number (762), into its hexadecimal equivalent. FA ee 101 | 110 | 010 0001 | 0111 | 0010 Answer: (172),,; @. Convert Octal Number (345), into its equivalent Hexadecimal number, © Octal Number = 345, * Divide each digit into 3 bits. = Combine all bits: + 011100101 ‘+ Make group of 4 bits and convert 3 leading Os added yr 0000 | 1110 o into hexadecimal equivalent. * The converted number is: +165),The following table summarizes the number representation in decimal, binary, octal and hexadecimal number system: ‘Table 9.2: Number representation in decimal, binary, octal and hexadecimal number system ee a 5 ° 0 0 1 1 1 1 2 10 2 2 A n 3 3 4 100 4 4 5 101 5 5 6 10 6 6 7 m 7 7 8 1000 10 8 9 1001 " 9 10 1010 2 A uN 1011 13 8B 2 1100 14 c 3 1101 15 D 14 m0 16 EN 15 mn 7 F 9.4 ARITHMETIC OPERATIONS IN BINARY SYSTEM All the arithmetic operations such as addition, subtraction, multiplication and division can be performed on binary numbers in the same way the operations are performed on decimal numbers. Here, we will discuss only addition. Binary Addition in decimal addition, if you add 8 + 2, you get ten which you write as 10; in the sum this gives Fadigit 0 and a carry of 1. Something similar happens in binary addition when you add 1 and 1; the result is two (as always), but since two is written as 10 in binary, we get, after summing. 1+ Lin binary, a digit 0 and a carry of 1.) ‘The rules for adding two binary numbers are’ Cray rors Pee Pea Fig. 9.4: Rules for Binary Addition Ey 3 z 5 3 £ 2 3 IComputer Science with Python-X For example, (1) Add 110101 and 101111 110101 #101111 (2) Add 101.0111 and 111.1011 101.0111 111.1011 1100100 1101.0010 9.5 INTERNAL STORAGE ENCODING OF CHARACTERS The data in computers is stored in binary form. The data can be a numeric data or a non- numeric data, which can be alphabets or any other special characters. These non-numeric data to be alphanumeric data. There are some predefined codes which are used to represent the numeric and non-numeric characters. These codes are known as alphanumeric codes. Fhe various codes for data representation are: (> ASCII (American Standard Code for Information Interchange) > ISCII (Indian Standard Code for Information Interchange) > UNICODE (Universal Coding Standard) 9.5.1 ASCII (American Standard Code for Information Interchange) . (ASCII code is the most widely used alphanumeric code which is used in computers to translate ‘text (letters, numbers, and symbols) into a form that can be sent to and understood by other computers and devices such as modems and printers. It is developed by the American National Standards Institute (ANSI). The standard ASCII character set uses just 7 bits for each character and so ithas 2, =128 possible code groups. It represents all of the standard keyboard characters as well as control functions such as Return & Linefeed functions. The characters encoded are numbers 0 to 9, lowercase letters a to z, uppercase letters A to Z, basic punctuation symbols, control codes that originated with Teletype machines, and a space. Table 9.3: Standard or Lower ASCII Characters and Codes A TT 034 035 036 037 038 039 040 001000 1 001000 10 001000 " 001001 00 001001 or 001001 10 001001 u 01010 00 A 066 067 068 068 010000 a1 010000 b 098 10 010000, 099 u 10001 100 00 010001 o1 10001 10 10001 n 010010 00.oat 042 043 045; 047 048 049 050 051 052 053 054 055 056 0s7 058 059 061 062 063 01010 01 01010 10 01010 n oo1o11 00 ooro1t a 01011 10 oo101t u 001100 00 001100 01 001100 10 (001100 " 001101 00, 01101 a oor101 10 01101 u 001110 00 001110 1 001110 10 001110 " 001111 00 oor a 01111 10 ont n 010000 00 073 074 07s: 076 077 o78 079 080 082 083 085 086 087 088 089 090 091 092 093 094 095 096 o10010 o1 010010 10 10010 " 10011 00, 10011 a1 10011 10 10011 " 010100 00. 010100 a 010100 10 010100 " oro101 00 ono101 or 10101 10 oro101 n o10110 00 10110 01 oro110 10 o10110 u orornt 00 ono1nt o1 ort 10 ono1nt " 011000 00. 105 106 107 108 109 10 m m2 13 4 ns Ne 7 8 9 120 121 122 123 124 125 126 127 Data Representation and Boolean LogicComputer Science with Python-XI Q.1. Write the ASCII-7 coding for the word BYTE in both binary and hexadecimal notations. How many bytes are required to store this word using this coding? Ans. In ASCII-7 code, the word BYTE can be written as: B = 1000010 in binary and 42 in hexadecimal Y = 1011001 in binary and 59 in hexadecimal T = 1010100 in binary and 54 in hexadecimal E = 1000101 in binary and 45 in hexadecimal Hence, ASCII-7 coding for the word BYTE will be 1000010101100110101001000101 in binary and 42595445 in hexadecimal. Since each character in ASCII-7 requires one byte for its representation and there are 4 characters in the word BYTE, so 4 bytes will be required to store this word using this coding, 9.5.2 ISCII (Indian Standard Code for Information Interchange) In 1991, the Bureau of Indian Standards adopted the ISCI. It is an 8-bit code which allows English and Indian scripts’ alphabets to be used simultaneously. Characters coded in ISCII need 8 bits for each character} To use Indian languages on computers, ISCII codes are used. It is an 8-bit code capable of coding 256 characters. x ISCII code retains all ASCII characters and offers coding for Indian scripts also. There are 15 officially recognized languages in India: Hindi, Marathi, Sanskrit, Punjabi, Gujarati, Oriya, Bengali, Assamese, Telugu, Kannada, Malayalam, Tamil, Urdu, Sindhi and Kashmiri, Out of these, Urdu, Sindhi and Kashmiri are primarily written in Perso-Arabic scripts, besides in Devanagari, waeésematiuiamadtcarssrgaT aaeee Savage essuraeseeassse nome he GEREMaVaUSTSHTETOSVETT amSSCARAAABAWaAasHABsIBHAZS ae aaaaaagsddsteadaroaecscooed tit ABOFL MITT LoS SMS UFRSHL MSH | sang weg sed deam DID OLLESONDSSIAW | Kamas PUNAM MID VODOLLBIANFAIG ode | saigain 9 6D BD? 8 BO £9 99 9 OG Ong G G9.O7a AUN =e) Fig. 8.5: 15CII Codes in Different Languages Characters coded in ISCII need 8 bits for each character. This standard not only applies to the Devanagari script but also to Gujarati, Bengali, Gurmukhi, Assamese, Telugu, Kannada, Malayalam and Tamil scripts. 9.5.3 UNICODE (for Multilingual Computing) Wnicode is a new universal coding standard adopted by all new platforms. It is promoted by Unicode Consortium which is a non-profit organization. Unicode provides a unique numberfor every character irrespective of the platform, program and the language. It is a character coding system designed to support the worldwide interchange, processing and display of the written texts of the diverse languages)A unique number for every character, no matter what the platform, no matter what the program, no matter what the language. Significance of UNICODE > Unicode enables a single software product or a single website to be designed for multiple platforms, languages and countries (no need for re-engineering) which can lead to a significant reduction in cost over the use of legacy character sets. Unicode data can be used through many different systems without data corruption. Unicode represents a single encoding scheme for all languages and characters. vvyv Unicode is a common point in the conversion between other character encoding schemes. Since it is a superset of all of the other common character encoding systems, you can convert from one encoding scheme to Unicode, and then from Unicode to the other encoding scheme. > Unicode is the preferred encoding scheme used by XML-based tools and applications. | CIM: Unicode is @ way to include all the different schemes into one universal text-encoding. STF 8, UTF 16, UTF 32 Oe ~ ‘UTF stands for Unicode Transformation Format. UTF was developed so that users have a standardized means of encoding the characters with the minimal amount of space, Unicode and Code Points Cunicode character set mapped each character in the world to a unique number. This ensured that there are no collisions between alphabets of different languages. These numbers are platform- independent. These unique numbers are called code points in the Unicode terminology. UTF-16 and UTF-32 are the only few established standards for encoding) UTR UTE-8 Encoding ITF-8 encoding is a variable-sized encoding scheme to represent Unicode code points in emory. Variable-sized encoding means the code points are represented using 1, 2, 3 or 4 bytes depending on their UTF-16 Encoding CUTF-16 encoding is a variable-byte encoding scheme which uses either 2 bytes or 4 bytes to represent Unicode code points,Most of the characters for all modern languages are represented using 2 bytes. (UT-32 encoding is a fixed-byte encoding scheme and it uses 4 bytes to represent all code points.) UTF-8, UTF-16 and UTF-32 are the different ways to represent them in byte format. Both UTF-8 and UTF-16 are variable length encoding, where number of bytes used depends upon Unicode code points. On the other hand, UTF-32 is fixed width encoding, where each code point takes 4 bytes. Unicode contains code points for almost all representable graphic symbols in the world and it supports all major languages, e.g., English, Japanese, Mandarin or Devanagari. Data Representation and Boolean LogicComputer Science with Python-XI The main advantage of UTF-8 is that it is backward compatible with ASCII. The ASCII character set is fixed width and only uses one byte. When encoding a file that uses only ASCII characters with UTE-8, the resulting file would be identical to a file encoded with ASCII. This is not possible When using UTF-16 as each character would be two bytes long. 9.6 BOOLEAN LOGIC Have you ever wondered how a computer can do something like balancing a checkbook, or playing chess or spell-checking a document? These are things that, just a few decades ago, only humans could do. Now, computers do them with much ease. How can a “chip” made up of silicon and wires do something that seems like it requires human thought? If you want to know the answer to this question, the first thing you need to understand is something called Boolean logic. Boolean logic was originally developed by George Boole in the mid-1800s, who figured out a way to put formal logic into mathematical form. Simply put, Boolean logic is a very easy way to figure out the truth of an expression using the simple concept of true or false. Consider the following examples: > Should | go to a restaurant or not? > Should | purchase a new mobile phone or not? > Should | opt for Computer Science or not? x All these statements can have only one answer, either in the form of yes or no. Thus.a binary decision always results in either yes/no or true/false. Likewise, a switch has only two states— open and closed. An open switch represents binary 0 and a closed switch represents binary 1. Open closed (binary 0) (binary 1) Fig. 9.6: Showing Open and Closed switch ‘The digit 1 or letter 'T’ is used to represent true value and the digit 0 or letter ‘F’ represents a false value. A statement which evaluates either true or false is known as Proposition (or logical statement). CTM: 1 and 0 are two binary-valued quantities that represent true or false state. (Boolean Variable A Boolean variable is also known as binary variable or logical variable that takes its values from Boolean algebra. A Boolean variable can take only one binary-valued quantity out of the two possible values, ic., yes/no, 1/0, true/false) One bit represents one Boolean variable. In electrical circuit, if the signal passes, it represents 1, else it is represented through 0. |Boolean Constant (Che values which are stored in binary variables are known as Boolean Constants. Therefore, the values true/false, yes/no or 1/0 are Boolean constants. Boolean Statement: A statement is said to be a Boolean/Logical Statement if it has a di value which is either false or true. Examples: va sd or RAE ae RRCERI ow ADO SAG aE rd we jescieen Variable: A variable which holds false/true value is known as Boolean variable. (XY.2, Wete:) Boolean Expression: A meaningful combination of Boolean operators (AND/OR/NOT), Boolean operand/variable (X, Y, Z, etc.) and Boolean constant (0 or 1) is known as Boolean Expression (Logical Expression) Example: X+Y.Z A. (B+C) +B U OR V AND NOT 2) 9.7 BOOLEAN OPERATORS 2 Operators used in Boolean algebra are known as Boolean/logical operators. Basic logical operators and their notations are shown below: eT a a SE OU a iM ~ XY X4Y x Kay xvy ~ 9.7.1 AND Operator AND operator is a binary operator that operates on two variables and the operation performed by AND operator is known as logical multiplication. The symbol used for logical multiplication is dot (.) operator. Consider the following values for two variables in a given Table 1. Now, when there is logical multiplication using AND operator, the result will be as shown in Table 2. Table 1 Table 2 7 oo =o ec an ‘The AND operation will result in true value (1) when both inputs are 1 (true/high), and for all other values it results in 0 (false/low). PLU un er}Cea ca LLU Clee 9.7.2 OR Operator The OR operator is a binary operator that operates on two variables and the operation performed by OR operator is known as logical addition. The symbol used for logical addition is plus (+) operator. Consider the following values for two variables A and B as shown in Table 1. When there is logical addition using OR operator, the result will be as shown in Table 2: ve Tablet Table 2 ~ 2 ooo oa 0 ° of 1 ao. 1 1 1 ‘The OR operation results in true value (1) when either of the inputs is 1 (true) or both the inputs are 1 (true/high), and for all other values of inputs it results in 0 (false/low). 9.7.3 NOT Operator Lx The NOT operator is a unary operator that operates on one variable and the operation performed by NOT operator is known as negation or complementation, x Consider Table 1 and 2 with values 0 and 1 for variable A. Table 1 Table2 a Han ° ° 7 1 1 ° It means that the logical statements A and A’ are opposite to each other: If the value of a variable A is 0, its complement would be 1, and if the value of the variable A is 1, its complement would be 0. 9.8 TRUTH TABLE A truth table is a representation of a Boolean function or expression containing all possible combinations of input values and their result in a tabular format{If the result of a logical expression or logical statement is always true or 1, it is known as Tautology. If the result is always false or 0, it is known as Fallacy The number of rows in a truth table is calculated as 2" where n is the total number of Boolean variables. Therefore, if there are two variables A and B, then the possible input values will be 2? = 4 combinations. It can be represented as follows: - ERE oO ° 1 1 1 ° 1If there are three variables A, B and C, then the possible input values will be 2° = 8 combinations. It can be represented as follows: B-ece-6eo Rules for Writing Truth Table 4. First check the number of literals or variables in a Boolean expression. 2. Draw columns for each unique variable. For example, if there is a Boolean expression as ‘A+B.C, then there will be three columns, one for each variable. 3. Draw columns for each logical expression. In a Boolean expression A+B.C, there are two logical operations, viz. AND and OR operation. 4. Draw rows which can be calculated as 2° where n is the total number of variables. In the example given above, there are three variables A, B and C. Hence, total number of rows will be 2°= 8. 5. Write 0's in the first half for the number of rows in the first column and in the second half, for number of rows, write 1's. 6. Similarly, write 0's in the first half for the number of rows which have 0's in the first column and 1's in the same number of rows. Repeat this pattern till 0's and 1's have been written for all 0's and 1's of the first column. 7. Thispattern will continue till you reach the last column with the pattern 0's and 1's alternatively, Calculate the result for each logical operation by considering the values for input variables written in each row. Let us discuss some questions on creating truth table for Boolean expressions. Q.1. Write a truth table for the Boolean expression: F=A.B'+C by writing each step. Ans, Follow the given steps for writing the truth table: 1, In the given expression, there are three variables A, B and C. 2. Draw three columns for each possible input variable combination and three columns for each logical operations AND, NOT and OR and 2° = 8 rows such a Ee aa Pe ee unrThe NOT operator has the highest priority and OR has the lowest priority. For evaluating the Boolean expression, the following rules should be followed: > Rules for Evaluating Boolean Expression: Evaluate the Boolean expression from left to right. Evaluate the expression in parentheses first. Perform all NOT expressions. Perform all AND expressions. .. Perform all OR expressions. sen Precedence of operators can also be illustrated with the help of a truth table. Consider a Boolean expression X.Y'+Z . eee i 0 Bao 1 ° ° o Be 1 1 ° 1 ° 1 a ° ° 1 1 i. 0 1 1 ° ° 1 1 1 1 ° 1 1 1 1 1 1 m0 Ee ° : 1 1 1 M0 1 In this truth table, AND operation is performed first and then OR operation is performed. Example: Prove the following with the help of a truth table: x.(y+z)=(xy)+(x.2z) x Es / ° ° ° ° ° 0 ° ° ° 1 1 ° ° ° ° ° 1 ° 1 ° ° ° ° o 1 1 1 ° ° ° ° 1 ° ° ° ° ° ° o 1 ° 1 1 1 ° 1 1 1 1 ° 1 1 1 ° 1 1 1 1 1 1 1 1 1 CCTM: The order of precedence for logical operators is NOT, AND, OR 9.9 LOGIC GATES A Gate is a circuit which takes one or more inputs and generates an output. Logic Gates use the binary operators AND, OR and NOT. There are three fundamental Logic Gates which are as follows: 1, NOT Gate 2. AND Gate 3. OR Gate NOT Gate NOT gate, sometimes called a logical inverter gate to differentiate it from other types of .ctronic inverter devices, has only one input. It reverses the logic state. The output state is a negation or complement of an input signal.) PL r e )OO eds Lee AND Gate Che AND gate is so named because if 0 is called “false” and 1 is called “true, the gate acts in the same way as the logical “and” operator. The output is “true” when both the inputs are “true.” Otherwise, the output is “false”. AND Gate works on two or more inputs which result in a single outpuf\ R Gate the OR gate gets its name from the fact that it behaves like logical inclusive “or.” The output is “true” if either or both of the inputs are “true.” If both inputs are “false,” then the output is ‘false’. OR Gate works on two or more inputs which result in a single output,) NOR Gate ‘The NOR gate is a combination OR gate followed by an inverter. Its output is “true” if both the inputs are “false.” Otherwise, the output is “false.” * NAND Gate he NAND gate operates as an AND gate followed by a NOT gate. It acts in the manner of logical operator “and’” followed by negation. The output is “false” if both the inputs are “true.” Otherwise, the output is “true” XOR Gate (The XOR (exclusive-OR) gate acts in the same way as the logical “either/or The output is true” if either, but not both, of the inputs is “true.” The output is “false” if both the inputs are “false” or if both the inputs are Bes Another way of looking at this circuit is to observe that the output is 1 if the inputs are différent, but 0 if the inputs are the same. The following table shows the truth table and logic gate of various operators. Operator | Truth Table Logic Gate Pe aS | PQ3. Draw a circuit diagram corresponding to the following Boolean expression: =A.B'+C:D Q.4. Write equivalent Boolean expression for the following Logic Circ L7 ee Up v—+t—peH Ley w—bo Ans. (U.V)+(U'W) Q.5. Write equivalent Boolean expression for the following Logic Circuit: Ee eee Ans. (u'+v).(v'#w) 9. ie DE MORGAN’S THEOREMS péMorgan has suggested two theorems which are extremely useful in Boolean Algebra. The two theorems have been discussed on the next page. Peo eerCO cues Lee Theorem 1 FOF every A, BEB (A+ By =4.BY (A.B) The left hand side (LHS) of this theorem represents a NAND gate with inputs A and B, whereas the right hand side (RHS) of the theorem represents an OR gate with inverted inputs. +B (by Duality) Truth Table showing verification of De Morgan's first theorem (A+B) =A.B" Pee ee Laos tact ne 0 1 ° ° 1 1 1 1 o 0 ° o ° ° ° ° Gate implementation of the above theorem is: DS] . Theorem 2 For every A, BEB (A. By =A +B" (by Duality) The LHS of this theorem represents a NOR gate with inputs A and B, whereas the RHS represents an AND gate with inverted inputs. Truth Table showing verification of De Morgan's second theorem (A. By =A4+B (by Duality) 1 + Ree eee 1 1 1 1 ° 1 ° ° Gate implementation of the above theorem is: \ oe Toe BYTES Number system is the technique to represent numbers in the computer. Binary number system has only two symbols, and its base is 2. Base of a number is also known as radix of a number. ‘The decimal numbers contain 10 digits or symbols : 0, 1,2, 3, 4,5, 6, 7,8,9 ‘The octal numbers contain 7 digits: 0, 1, 2, 3, 4,5, 6 ‘The hexadecimal numbers contain 16 symbols: 0, 1, 2, 3, 4, 5,6, 7,8, 9, A,B, C,D,E, F ‘The right-most digit is called the least significant bit and the left-most digit is called the most significant bit, ASCII, ISCil and UNICODE are the three most popular encoding systems used today for character translations. Boolean statement is any logical statement which has a definite value which is either false or true. ‘A Boolean variable is also known as binary variable or logical variable that takes its values from the Boolean algebra. ‘The values which are stored in binary variables are known as Boolean constants. For example, true/false, yes/no or 1/0 are Boolean constants. A Boolean variable is a variable which holds false/true valve. A Truth table is a representation of a Boolean function or expression containing all possible combitiations of input values and their result in a tabular format. ~ Boolean operators are operators used in Boolean algebra. For example, AND, OR, NOT, NOR, NAND and XOR. A Gate is a circuit which takes one or more inputs and generates an output. Logic Gates use the binary operators AND, OR and NOT. BALIN THE BLANKS In binary number system, the left-most bit is called the . Base of a number Is also known as of a number. The decimal system is composed of symbols, code is the most widely used alphanumeric code which is used in computers to translate text (letters, numbers, and symbols). . Unicode is a new universal coding standard adopted by all new The __ operation is Boolean multiplication and the __ operation is Boolean addition. A statement is said to be a if it has a definite value, which is either True or False. gate has only one input and it complements an input signal. . The values which are stored in binary variables are known as A is a representation of a Boolean function or expression containing all possible combinations of input values. ANSWERS TO FILL IN THE BLANKS most 2. radix 3. 10 ASCII 5. platforms 6. AND, OR /. Boolean/Logical Statement 8. NOT Boolean Constants 10. Truth table reo ur ean ednce with Python-) SOLVED QUESTIONS 1. What do you understand by number system? [Ans. Number system is the technique to represent numbers in the computer system architecture. When this data is fed into the computer, itis converted into numeric format by ASCII (American Standard Code for Information Interchange), where each type of data is represented by its numerical equivalent. The value of each digit in such a number is determined by three things: + The digit itself The position of the digit in the number + The base or radix of the number Examples of number system are: Binary, octal, decimal and hexadecimal number system. BeConvert (38.625), into its binary equivalent. ‘Ans. First convert 38 into a binary number, which is: (Refer to Section 3.3.1.1) 138 38 Remainder 3 0 9 4 2 1 Hence, (38), = (100110), Now, convert 0.625 into binary fraction, which is: (Refer to Section 3.3.1.2) 1.250 A(LSB) 0.250 0.500 ° 0.500 1.000 1(MSB) 0.000 (0.101), (100110.101), 0.625 «2 0.2502 0.500 x 2 Therefore, (0.625),. Hence, (38.625), 7. Convert (1102), into decimal number. ‘Ans. Binary number is 1201, So, 1101 = (1 x 29) + (1 2!) + (0x 24) + (1x24) 1 x 8) + (1 4) + (0x2) + (14) +4e042 Answer is (13),, 4, Convert (EF.B1),, = (?)20. Ans, = EF.61 x16) + Fx 16°. Bx 164+ 1167 4x16 +15x1. 11% (1/16) +1%( 1/256) 24 + 15 . (0.6875) + (0 00390625) 39 + 0.6914 39,691406 Answer is: (239.691406),,, Convert (2C9),, into decimal x 167412 x 16449 « 16° 12419249 713),, Answer is :(713),.Computer Science with Python-XI 286 Zo (A+ BIB +0) 44, Verify the following using truth table: (a) XX"=0 (b) X+1=1 ns. fot x | « [xx [x o>. ot] o|.fo}4 1poeloe]4 _pPe fet 15. Draw a circuit diagram corresponding to the following Boolean expression: c 16. Draw a circuit diagram corresponding to the following Boolean expression: = (ABy' + (CDy s Ans. The given expression is: F = (X+ ¥)(Y #2). Itean be writen as: (X NOR Y) NOR (Y NOR). The logic diagram for the given expression is: eer) ta s—|_} [ee sl 17. Draw a circuit diagram using NOR gate for the Boolean expression F=(X+¥}(Y#2).. Ans. The given expression is: F = (x+y) (y +2). Itcan be written as: (X NOR Y) NOR (Y NOR 2). The logic diagram for the given expression De ser FDR) y¥——_J Zz YNORZ 418. Obtain the Boolean expression for the logic circuit shown below: (CBSE 0 2014) Aro boa F c D Ans. A’.B+(C+0')19. Write the equivalent Boolean expression for the following Logic Circuit: (CBSE D 2011) z ‘Ans. F(P,Q,R)= PQ’+ PR’ 20. Which gate is the following circuit equivalent to ela [> output aa (a) AND {b) OR (c) NAND- (a) NOR (e) None of these Ans. (c) is the correct answer. UNSOLVED QUESTIONS 1. Convert decimal number into binary number. (2) 82 (0) 44 (c) 25 (a) 62 2. Convert decimal number into octal number (a) 911 (0) 540 () 61 (a) 132 3. Convert decimal number into hexadecimal number. (a) 132 (b) 3619 (c) 206 (a) 752 4, Convert binary number into decimal number, (a) 10111 (b) 111201 (©) 101010 (a) 101102 5. Convert octal number into decimal number. (a) 75 (b) 322 (e) 142 (a) 205, 6. Convert hexadecimal number into decimal number, (a) a2 (b) 138 (271 (a) 132 7. Discuss UTF-8 encoding scheme. How is it different from UTF-32 encoding scheme? ‘8 What are Boolean constants? 9. What are Boolean operators? Explain AND, OR, NOT operators. 10. Verify the following using truth table: (1) aarb) (2) K(V42) =X. YX. 11, Obtain the Boolean expression for the logic circuit shown below: Ls . State De Morgan's law and prove it with a truth table. eS ale Pee ec eer