Za A Chapter Digital Electornics Digital electronics are those electronics systems that use a digital signal instead of an analog signal. Digital electronics are the most common representation of Boolean algebra and are the basis of al digital circuits for computers, mobile phones and numerous other consumer products. ‘The most common fundamental unit of digital electronics is the logic gate. By combining numerous logic gates more complex systems can be created. The complex system of digital electronics is collectively referred to.as a digital circuit. v 1. Digital Signal It is a signal that is constructed from a discrete set of waveforms of a physical quantity so as to represent a sequence of discrete values. 2. Analog Signal It is any continuous signal for which the time varying feature (variable) of the signal is a representation of some other time varying quantity, i.e. analogous to another time varying signal. Number System Number system basically means the representation of number with limited number of symbols. Like most widely used number system is the positional number system. The position of various digits indicates the significance to be attached to that digit. Thus, a set of values used to represent the different quantities is known as number system. Radix or Base ‘The number of digits require to represent all the numbers in a particular number system is called radia. eg, the radix of binary system is 2, because in binary number system just two digits (ie. 0 or 1) are used to represent all numerical values. Similarly, the radix of decimal number system is 10 because 10 digits (i. 0 to 9) are used to represent all numerical values Types of Number System Four types of number system which are used most commonly are as follow 4, Binary Number System Computers use binary number system for counting and arithmetic operations. This number system has base 2 as it uses 2 digits 0 and 1. A string which have any ‘combination of these two digit is called binary number. ‘A binary number showing its base would be written as (11001). 2. Octal Number System ‘The octal number system has a base of 8, meaning that it has eight unique symbols 0, 1, 2, 3, 4,5, 6 and 7. Thus, each digit of an octal number can have any value from 0 to7. Any octal number is a string of any combination of these digits. An octal number showing its base would be written as (2317) 5, (7065) , (1257), etc. 3. Decimal Number System ‘The number system that we use in our day-to-day life is the decimal number system. Ithas base 10 as it uses 10 digits from 0 to 9 (ie. 0,1, 2,3,4,5, 6, 7, 8and 9). Any decimal number is a string of any combination of these digits. A decimal number showing its base would be written as (257) 9 or (257). Where, 10’ and the small, letter ‘a’ designate that itis a decimal number. 4, Hexadecimal Number System In hexadecimal number system, the base or radix is 16. Thus, it has 16 possible digit symbols. It uses the digits 0 to9 and letters A, B, C, D, E and F (with respect to 10, 11, 12, 13, 14 and 15), Any hexadecimal number is a string of any combination of these digits. This number system is generally used in micro computers. A hexadecimal number showing its base would be written as (134BD),,.Computer Concepts Digital Electronics Conversion between the Number Systems Different types of conversion between the number «ystem are discussed below : 4, Decimal to Binary step 1 Divide the given number by 2. step 2 Note the quotient and remainder. Remainder should be 0 or 1. If quotient # 0, then divide the quotient by 2 and again back to step 2. If quotient =0, then stop the process. First remainder is called as Least Significant Bit (LSB) and last remainder is called as Most Significant Bit (MSB). Arrange all remainders from MSB to LSB. £8. (43)10 >(?)2 step 3 step 4 Remainder Then, (43g -> (101011), 2. Binary to Decimal Step 1 Multiply all the digits by powers of 2 (ie. by their respective positional weights). The power for integral part will be positive and for fractional part will be negative. Add all the products to obtain respective decimal number. eg, (1101.10), > (Do (1101.10), = 1x 23 + 1x 2? + 0x 2! + 1x 2° Step 2 Step 3 41x 21 + 0x27? =84440+140.5+0=13.5 Then, (1101.10), + (13.5),y 3. Binary to Octal Step1 Make the group of three bits from right to left. Step 2 Now, convert each group to corresponding decimal number. eg, (110110100), > (?)g 1110)110),100) hove 6 6 4 (110110100), —> (664), 4. Octal to Binary Convert every digit of the octal number from octal to binary in the group of three bits. (just opposite to that of binary to octal conversion) eg. (1034. 5), > (a te. eS bbe bye 001j,000).011).100) 101, Then, (1034, 5), -» (00100001 1100.101), 5. Binary to Hexadecimal Step 1 Start making the group of four bits each from right to left from the given binary number. If some bits are less while making 4 bits group, then include required number of zeros on extreme sides. Now, write Hexa-decimal digit corresponding to each group of 4 bits. eg. (1111010111011) > (ig (0011, 1101, ,0111, 011, 4+ bo bie 3°0B 7 WW D B Step 2 ‘Then, | (1111010111101 ), > (3D7B ig 6. Hexadecimal to Binary For this type of conversion, convert each hexadecimal digit to 4 bit binary equivalent. eg. (BABI) >()2 BOA 8 1 +bovie 1011, 1010, ,1000,, 0001, Then, (BA81 yg ~>(1011101010000001 )» 7. Decimal to Octal Step 1 Divide the given number by 8. Step 2. Note the quotient and remainder. Digits of remainder will be 0 to 7. If quotient « 0, then again divide the quotient by 8 and go back to step 2. If quotient =0, then stop the process. Write each remainder from MSD to LSD where MSD is last remainder and LSD is first remainder. eg. (97647 hg > (2p Step3 Step 4 Step 5“97647 |71SD 12205 |5 - Ss 8 8 8 8 8 pees: Oa (97647),o -> (276557) rate Then, 8. Octal to Decimal Step 1 Multiply each digit of octal number with power of8. Step 2 These powers should be positive for integral part and negative for fractional part. Step 3 Add all the products to obtain respective decimal number. eg B27) + Mo (327. 4) = 3x 8? + 2x 81+ 7x 89 +4x 8°! 230 644 2 84 Tx 144 = 192+ 16+ 740522155 Then, (3274) > (2155)y9 9. Decimal to Hexadecimal Step 1 Divide the given number by 16. Step 2 Note the quotient and remainder. Digits of remainder will be 0 t09 or A to F. If quotient + 0, then again divide the quotient by 16 and go back to step 2. If quotient = 0, then stop the process. ‘Write each remainder from MSD to LSD. 2g. (92998 >? is Step 3 Step 4 Step 5 13 ameeT BSD 16 (58124 |124C 16 [3632 b | 6 bf ie fit fis-ve mo 0 it Then, | (929987) 9 —>(E30C3)i4 10. Hexadecimal to Decimal Step 1 Multiply each digit of hexadecimal number with power of 16. Step 2 These power should be positive for integral part and negative for fractional part. Step 3 Add all the products to obtain respective decimal number. Prep Guide MAH-MCA CET eg. (BCI.Bi6 (0 (BC9. 8), =Bx 16? +C x16! +9x 169 +816" = 11 256+ 12x 16+ 9% 14-8 16 = 2816+ 19249405 =30175 Then, — (BC98)y > (3017.5) 0, 11. Octal to Hexadecim: Step 1 Convert the each digit of octal number to binary number. Again, convert each binary digit to hexadecimal number. 2g. (7632)p +(e 7 6 3 Step 2 2 doled 1 U1 L10,011,,010, (7632), > (111110011010), Now, 1111, 1001, ,1010, bovioy 1s 9 10 F A Then, (7632) >(F9A)ie 12. Hexadecimal to Octal Step 1 Convert the each digit of hexadecimal number to binary number. Step 2 Again, convert each binary digit to octal number. eg (AC2D)5 2(%)5 ac 2D Acca 11010, 11100, ,001 «1101, Now, (AC2D)yg ->(1010110000101101) 1004, 010,110, 009, 101, 101, v yLde 1 6 0/5. 5. volBe Then, (AC2D) 5 -> (126055), Computer Arithmetic Arithmetic Operation 1. Binary Addition works in the same way, except that only 0's and 1’s can be used, instead of the whole spectrum of 0-9.computer Concepts Digital Electronics This actually makes binary addition much simpler than decimal addition, as we only need to remember the following rule : 0+0=0; O+151 140=1; —1+1=10 (which is 0 carry 1) Asan example of binary addition we have, 101 +101, 1010 (i) Toadd these two numbers, we first consider the “ones” column and calculate 1 + 1, which (in binary) results in 10. We “carry” the 1 to the “tens” column and the leave the 0 in the “ones” column, (i) Moving on to the “tens” column, we calculate 1 + (0,0), which gives 1. Nothing “carries” to the “hundreds” column and we leave the 1 in the “tens” column. (ii) Moving on the “hundreds” column, we calculate 1 +1, which gives 10. We “carry” the 1 to the “thousands” column, leaving the 0 in the “nundreds” column. Another example of binary addition : 1011 +101 10110 A 2. Binary Subtraction is simplifies as well, as long as we remember how subtraction and the base 2 number system. To subtraction as we only need to remember the following (with a borrow of 1) For 10 minus 1, 1 is borrowed from the “tens” column for sein the “ones” column, leaving the “tens” column with only 2. o The following examples show “borrowing” in binary subtraction : 10100 1010 sl =10., =ild 1. 40 Binary Multiplication Binary multiplication is performed in the same manner as decimal multiplication. Itis much easier, since there are only two possible results of multiplying two bits. ox ox 1x 1x Binary Division Division in the becinary number system employees the same procedure as division in the decimal system, as will be seen in following examples : n0+11 11) 110 (10 dL 00. 00 10 Answer: Representation of Numbers In general, a number can be represented by its magnitude and a sign to show that whether it is a positive number or negative number. For positive number, a plus (+ve) sign is indicated before number and for negative number a minus (- ve) sign is indicated before number. A number with no sign is treated as a positive number. But in case of computer system due to hardware limitation everything has to be represented either by 0's. or 1's including the sign of a number. ‘Thus, in computer system an extra bit is introduced. called sign bit. When the value of sign bit is 1, it indicated that the number is negative and when sign bit {s0, it indicates that the number is positive. ‘The number that is represented by system can be integer fraction or mixed integer fraction numbers. ‘There are two representation techniques used to represent a number : (i) Fixed point representation (ii) Floating point representation.b) Prep Guide MAH-MCA CET 1. Fixed Point Representation In fixed point representation, we assume that the decimal point is fixed. In this representation, left most bit of register is used to store point. This register is used to store fraction number. In second register, right most bit is used to store the decimal point. This is used for integer storage. There are three ways of storing signed number as follows : (i) Sign-magnitude Representation In this represen- tation, MSB is used to represent sign (0 for positive and 1 for negative) and the remaining bits are used to represent the magnitude of the number. eg. Binary six bit number 011000 represent a positive number and its value is 24, whereas 111000 represents a negative number ~24. The maximum positive number that can be represent using sign magnitude form is + (2"~ -1) and maximum negative number is —(2"-" —1) where, nis number of bits. (Gi) One’s Complement Notation The 1’s complement of a binary number is found by simply changing all 1's to0's and all 's to1's. eg. + 9, is represented by (1001), and its 1’s complement. 1001 +9 t 0110 -9 (0110), represents ~940. ‘The maximum positive and negative number that can be represented are (2? -1) and -(2" -1), respectively. (ii) 2's Complement Notation The 2's complement of a binary number is found by adding 1 to the 1's complement. eg Binary number 10011 01100 —_1’scomplement of 10011 +1 Addi 01101 — 2's complement of 10011 2. Floating Point Number Representation The floating point number has both an integer part as well as fractional part. Thus, 0.726, 2.3462, 555.55 etc, are all floating point numbers. The floating point number consists of two parts, i. they are expressed as a combination of mantissa (the fraction part) and the exponent. eg. 0.00726 can be written as, 7.2610". ‘Thus, a floating point number can be expressed as N=MxRé Where, M is the mantissa and e represents exponent. IEEE Standard Floating Point Representation IEEE standard specifies two formats for representing floating point number. One for 32 bits operand (known as single precision) and another for 64 bits operand (known as double precision). Mantissa | Mantisea [Exponent] Mantiss |_| s | Exponent| Trction Toi abn Beit sz bit Tot tpi (a) Single precision (b) Double precision Both formats starts with a sign bit, 0 for positive sign and 1 for negative sign. Next comes the exponent, using cexcess-127 representation for single precision and excess-1023 representation for double precision. Finally, we have the mantissa fractions consisting of 23 bits in case of single precision and 52 bits in case of double precision. Thus, a total of 32 bits is needed for single precision and 64 bits is needed for double precision. Boolean Algebra Boolean algebra like any other deductive mathematical system, may be defined with a set of elements, a set of operators and a number of proved axiom or postulates. A set of elements is any collection of objects having a ‘common property. Ifk is a set and a,b are objects then the notation 4, b ¢ kis used to indicate that a and b are elements of k. Abinary operator defined over a set k is a rule that assign to each pair of elements taken from k. e.g. if then =r isa binary operator if and only if a, band cek. The postulates of a mathematical system from the basic of assumptions from which it is possible to deduce the rules, theorems and properties of the system. ‘The common postulates are as follows : Boolean Laws ‘Theorem e Commutative law (A+B) +CoAsBeO pC eee +AC Distributive law A+ (BC) =(A + B)-(A +0) Tdempotent law ‘Associative law Involution (Negation) lawComputer Concepts Digital Electronics See ‘Absorption law Tdentity law Dominant law Compl nt law Demorgan’s law Boolean Values The value of boolean variable can be either 1 or 0. Means if Ais a boolean variable then the value of Ais either 1 or 0. Boolean Operators There are four boolean operators that are used in boolean algebra which are as follows : 1, AND (.) Operator AND operator between two boolean elements 1 and 0 canbe defined as follows : 0-0=0; 01 1-0=0; 1 AND operator is also known as () operator. The value of AND operation is 1 if and only if all operands (elements) arel. You can write A-Bas AB (Meaning of both are same). 2. OR (+) Operator The function of OR operator is given below : 0+0=0; O+1=1 1+0=1; 1411 You can easily see that the result of OR operation is 0 if and only if all operands are 0. 3, NOT Operator NOT operator is also known as compliment operator and is denoted as A or A’. % 0-1 4, XOR Operator XOR operator is represented as (@) and is defined as follows: A@B=A-B+A-B 08 (0. 0@ 1=1 means (0-1 + 0-1) =1-1+0- 1@ 0 =1 means (1-0 +1-0) =0-0+1- 1@ 1=0 means (1-1 +1-1) =0-1+1+ ‘We can say that the value of XOR operation is 0 if A =B and 1if A+ Bfor A®@ B Truth Tables ‘A truth table is a good way to show the functions of a logic gate. It shows the output states for every possible combination of input states. The symbols 0 (false) and 1 (true) are usually used in the truth tables. ‘The example of truth table shows the inputs and output, ofan AND gate. Input A Input B Output Q 0 0 0 _o 1 0 i 0 0 1 1 1 Venn Diagram ‘A Venn diagram is used to visually represent the differences and similarities between two concepts. Venn diagrams are also called logic ot set diagrams and are widely used in set theory, logic, teaching computer science and statistics. A Venn diagram typically uses intersecting and non-intersecting circles to denote the relationship between sets.EXERCISES EF Chapter Challenges 1. Number system defined a set of values that is used to represent (a) quality (b) quantity (©) value (@) All of these 2. Bit at position zero is usually referred to as (@) Local Bit (©) Least Significant Bit (LSB) (©) Most significant Bit (MSB) (4) Least Significant Byte 3. In which system, each digit has a weight corresponding to its position. {a) Binary number system (b) Decimal number system () Octal number system (@) Allof the above 4, If we replace each ‘ON’ switch with 1 and each ‘OFF’ switch with 0, then we get a number system, called (a) binary number system (©) decimal number system (6) hexadecimal number system (4) octal number system 5. The 2's complement representation of (-539)jp in hexadecimal is (@) ABE (b) DES (©) DBC (d) 1E5 6. When an odd number is converted into binary number the LSB is (a)0 (b)1 ()0orl (d) None of these 7. What is the octal equivalent of the hexadecimal number of 132A? (a) 46252 (b) 11430 8. Binary equivalent of (CAB);, is (a) 110010100101 (b) 100010010011 (c) 111001101100 (d) 101101101001 9. How many gate(s) would be required to implement the following boolean expression after simplification? Expression : XZ +YZ @4 1 (e) 11452 (d) 46250 (2 (3 10. Which boolean law is represented below? AtA=A (a) Associative law (b) Commutative law (©) Idempotent law (d) Dominant law 11, In which of the following computer code, characters are represented by eight bits? (a) EBCDIC (b) ASCO. (©) BCD (a) None of the above 12. A toggle operation cannot be performed using a single (@) NOR gate (b) AND gate (©) NAND gate (4) XOR gate 13, Which of the following gates is called coincidence detector? (@) XNOR gate (©) OR gate (0) AND gate (a) XOR gate 414, In which of the following gates, the output is 1 if and only if atleast one input is 1? (a) NOT (b) AND (OR (@) NAND 15. In which logic gate, the output is complement of the input? (@) NOT (b) AND (OR (@) XOR 16. Which method of representation has two representations for ‘0’? (a) Sign-magnitude (b) 1's complement (©) 2's complement (a) All of these The arithmetic operations, addition, subtraction, multiplication and division, performed on the binary number is called (@) binary system (b) binary arithmetic (6) binary calculation (@) binary method If the radix point (binary point) is fixed and assumed to be to on the right of the right most digit, the representation of such number is called (@) fixed point (b) radix point (©) Floating point (a) None of these 7. 18.Computer Concepts Digital Electronics 49, How many lines the truth table for a four-input NOR gate would contain to cover all possible input combinations? (@4 (b) 12 8 (a) 16 20.1. . to encode a negative number, first the binary representation of its magnitude is taken, complement each bit and then add 1. (@) signed integer representation (0) 1’s complement representation (©) 2's complement representation (@) radix complement representation 21. What does the leftmost bit represents according to IEEE standards? (@) Sign of the number _(b) Position of the number (©) Weight of the number (d) All of these 22. When only magnitude of numbers is considered and sign is discarded the numbers are called as {a) signed numbers (b) unsigned numbers (© positive numbers (@) binary numbers 23. When the numbers are represented as positive or negative, they are called (@) unsigned number (© signed number (©) complement (@) binary number 24, Which method of representation of numbers occupies large amount of memory than other? (@) Sign-magnitude (b) 1’s complement (©) 2's complement (@) Both (2) and (b) 25, Determine the values of the binary numbers in 2's complement number is 10101010 (@) -86 (b) +86 (©) -98 (a) +98 & Previous Years’ Questions (PYOs) 32. The Boolean expression AB + AB' + A’C + AC is unaffected by the value of the Boolean variable22] @c A Bs (@) None of these 33, Suppose the largest n bit number requires, ‘d’ digits in decimal representation. Which of the following relations between ‘f and ‘d’ approximately correct? (a) d=2" (b)n=2" (0) d mlogig 2 34, Which of the following is equivalent to the Boolean expression (X + Y)-(X +¥)-(X +Y) 12022) } 26. The number of bits require to represent decimal number 4096 in binary form is ... (a) 16 (b) 10 2 (a) 13 27. How many gates would be required to implement the following boolean expression after simplification? Expression : AC + ABC @4 1 (o2 (3 28. How many bits are used in the exponent part of IEEE single precision format for the representation of floating-point numbers? (a) 32 bits (b) 8 bits (©) 16 bits (4) 24 bits 29, When signed numbers are used in binary arithmetic then which one of the following notations would have unique representation for zero? (@) Sign magnitude (0) 1’s complement (©) 2s complement (@) %s complement 30. The code where all successive numbers differ from their preceding number by single bit is (a) binary code (b) BCD (©) excess-3 (4) gray 31. For a 1 binary half subtractor having two inputs A and B, the correct set of logical expression for the output D=(A minus B) and X (=borrow) are AB, X=AB (a) XY (b) YX. (XY (a) XY 35, ‘Floating point representation’ is used to represent (a) Integers oma () Real numbers (6) Boolean values (4) Whole numbers 36, The minimum number of NAND gates required for implementing of Boolean expression, AB+ ABC + ABC is f@1 2 02) (b) 0 (3© 37, The maximum and minimum value represented in signed 16 bit 2's complement representations are om (a) ~ 16384 and 16383 (b) 0 and 32767 (©) - 32768 and 32767 (4) 0 and 65535, 38, Write the simplified form of the Boolean expression (A +C)(A+AD)+AC+C om (@)A+C WAee (ase (a) A+D 39. Ifa signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is high, the gate is a(n) 0m (@) OR () NOR (@)NAND (@) AND 40. The number (2217) is equivalent to (20m (@) (608)i5 (b) (028F ig (©) (O48Fhig (a) 2297), 41. The binary multiplication 00 * 11 will give (0201 ul ©) 00 a (@10 42. Assume + represents negation of x the Boolean function x y +x + x’y is equivalent to? 12020) @x+y Oxty xy @rry 43, Consider the following circuit, in Db How many minimum numbers of two input NAND gates are required to design the above circuit? (2020) (a) 6 (b)4 (5 (d)3 44, The equivalence of given expression x +. y with Boolean theorem is... (020) @:x Wzty wr @o 45, The logic XOR operation of (44CO)y. and (B53F),, results 12020) (a) AACB (&) 0000 (©) FFFE (a) ABCD 4G. The binary equivalent of (234.125)y9? (2020) (@) (11101010101), (b) (10101010011), (©) (11101010.001), (4) (20101110011), 47. Determine the octal equivalent of (432267),)? (2020) (@) (432267), (b) (346731), (6) (2164432), (d) None of these 48. In IEEE single precision floating point representation, exponent is represented in ..... 2019] 49. 51. 55, Prep Guide MAH-MCA CET (a) 8 bit sign-magnitude representation (b) 8 bit 2's complement representation () Biases exponent representation with a bias value 17 (4) Biases exponent representation with a bias value 128 With 4-bit 2's complement arithmetic, which of the following addition will result in overflow? (2019) (a) 1111 +1101 () 0110 + 0110 (1101 + 0101 (4) 0101 + 1011, Decide which of the give conclusions logically follow from the given students(s) Statements All suns are moons. Some moons are planets Conclusions 1. All moons are suns. Il, At least some moons are planets. (@) Either conclusion I or Il is true (b) Neither conclusion I nor Il is true (6) Both conclusion I or IT is true (@) Only conclusion Tris true ors) If we can generate a maximum of 4 Boolean functions using m Boolean variables, what will be minimum value of 1? pom (a) 65536 1 (b) 16 (a4 . If the 2’s complement representation of a number is (011010), what is its equivalent hexadecimal representation? won (2) (10,6 (©) (1Ahg (©) (66 (8) (266 . For the circuit shown below, the complement of the output pon = F @o x (x @t | IFN is a 16-bit signed integer, then 2’s complement representation of N is (F87B);- Then, 2's complement representation of 8°N is @) (C308), (©) (1878), © (F878), (@) (9878) ‘The base (or radix) of the number system such that the following equation holds 312/20 =131 is 2010] @3 4 5 6 018]Computer Concepts Digital Electronics 56, How many Boolean expressions can be formed with 3 Boolean variables? pon @) 16 (932 (b) 1024 (a) 256 57. In an 8 bit representation of computer system the decimal number 47 has to be subtracted from 38 and the result in binary 2’s complement is ..... 12019] (@) 1110111 (b) 10001001 mm1001 (a) 11110001 58. Which of the following represents (D4);,? (@) (4B);s ~GBhg (©) (MB) - Ady (91505 ~ Dg (€) (EM¢ ~(ANg 59, What is the minimal form of Karnaugh map shown below? (Assume that x denotes a don't care term) aoa) (2019) @bd bd+be (©) ba+ aded (a) bd+ be+ ed 60. In order to store floating numbers in computers using the normalized representation and 32-bit single precision, the number of bits used for ‘exponent and fraction are _, respectively. (a) 11,21 (©) 16,15 12018) (016, 16 (a) 8,23 61, What are the values of R, and R, respectively in the expression (235)q, = (565)io =(1065)q,? ove) (a) 8, 16 (b) 16, 8 (8,12 (d) 16, 12 62. Ifa signal passing through a gate is inhibited by sending a low into one of the inputs and the output is high, the gate is po, (a) NOR (b) NAND (9 AND (@) OR 63. Given, ,/(224), =(13),, the value of the radix is (2018) (10 &)8 (5 (do 64, The output of the combinational circuit given below is @A+B+C (&) A(B+C) (BIC+A) (a) C (A +B) 65. Which one of the following expressions does NOT represent exclusive NOR of x and y? ote) (a) xy+ 87 (b) x07 (0 R@y (@ x6y 66. Consider the equation (43), =(y3)q, where x and y are unknown. The number of possible solutions is (a4 (b) 5 2018] ©6 (a7 67. Which one of the following boolean algebraic rule is correct? oI (@) A.4'=1 ()A+A'B=A+B (bl) A+ AB=A+B () A(A + B)=B 68. The representation of a floating point binary number +1001.11 in 8-bit fraction and 6 -bit exponent format is (@) Fraction : 01001110 exponent: 000100 (b) Fraction : 00001001 exponent : 000011 (© Fraction : 10010000 exponent : 110000 (d) Fraction : 00100100 exponent : 011000 69. Which term is redundant in the expression AB+A'C + BC? (a) BC (b) A'C (0 AB (@) None of these 70. Which of the following is the representation of decimal number (-147) in 2's complement notation ona 12 bit machine? poi) (a) 111101101100 (b) 110001001101 (© muo1101101 (4) 000001101101 71, Consider the equation (123)s =(x8), with x and yas, unknown. The number of possible solutions is (a. 2 3 @4 72. The smallest integer that can be represented by an wo 017] von 8 bit number in 2's complement form is [2017] (a) -256 (b) -128 (127 (@) 255 73, Which of the following in a functionally complete set of gates? 07) 1. NAND I NOR (a) I but not IT (b) I but not I (© Neither I nor 1 (@) Both I and 74, The total number of binary function that can be defined using boolean variables is vo @2 2" 2" (€) None of these% 75. Consider the following minterm expression for F. F(P,QRS)=E0,2,5,7,8,10,13,15 (018) The minterms 2,7,8 and 13 are ‘do not care’ terms. The minimal sum-of-product form for F is (QS + Os () QS + OS © + QRS + QRS+ QRS (@ PQS + Pas + Pas + POS 76. The Bollean expression represented by the following Venn diagram is oe, (@) aXORD (b) ab +a (ab+ab (A) (a+b) (@ +B) ‘77. The range of n-bit signed magnitude representation is, 2016) Prep Guide MAH-MCA CET (a) 0 to 2"-1 ()-@""!-1) to (2""! 1) (©) -@" =1) to (2-1) (@0t02""-1 78, The 2's complement representation of the number (-100),o in an 8-bit computer is 016), (a) 10011011 (b) 01100100 (6) 11100100 (4) 10011100 79. The number of terms in the product of sum. canonical form of |(%; + 2) (X3 *4)| is p16) (a7 8 9 (4) 10 80. Consider the equation (43), =(y3)g where x and y are unknown. The number of possible solutions are *\% Count Your Score Chapter Challenges L® | 20 | 3H] 4@ | 5 o ne | 2 | we | wo | w& ao | 2@ 1am | aw | @ aL.) Previous Years’ Questions (PYQs) a | 3 @ | 3% @ 35.) 36. (b) 26 | 86 | 4% | & © | 4 a2 & | 3 @ | 5% @) | 5s © | 56 @ 0 | Bo | Hm | | oo 2ola@iu@ loom | wo @4 6 5 @7 cae 81. Subtract (1010), from (1101), using first complement (2016) (@) (1100), ) (0101), (© oon, (4) (0011), 6 (b) t © 8. (a) 9 (a) 10. (c) 16. (a) 1. (a) 18. (a) 19. (d) 20. (c) 6. (d) 27. (b) 28, (b) 29. (c) 30. (a), 37. () 38, (b) 39. {c) 40. (c) 41. (b) 2@|eo | ao | so @ | no x. @) | se | 5 @ | 6. @ | a. ® 67. (c) 68. (a) 69. (d) | 70. (c) 2. © T7. (b) 78. (d) 79. (c) 80. (c) 81. (d)