] : ne Advance Problem Seton Digital Hlectronics \ Je Answer the following questions on SOP & POS forms = (a) Expand A + B in Sop and POS form. (b) Expand y = xy +z in POS form. (c) Express y = (A + B)(A + C) in Canonical POS form, (a) Express y = (4 + B)(C + D) in Canonical POS form. 2. Solve by Karnough's Map & hence verify = (a) y = ABC + ABC + ABC + ABC + ABC + ABC (b) y = AB + AC + BC (0) y= AC + AB + ABC + BC (a) y = ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD 3, Solve the following ‘Maxterm’ & ‘Minterm’ problems using K-map method s- (a) Reduce 5 m(0,1,2,5,7,8,9,10,13,15) (b) Reduce m(7,9,10,11,12,13,14,15) (©) Reduce m(1,5,10,11,12,13,15) (a) Reduce ¥ m(3,4,5,7,913,14,15) (€) Reduce FI M(0,1,4,5,6,8,9,12,13,14) (0 Obtain (i) minimal SOP & (ii) minimal POS for ¥,m(0,1,2,5,8,9,10).(Hint: Cells with 1 are grouped! obtain minimal SOP & cells with 0 ate grouped to obtain minimal POS.) (g) Minimize ¥ m(1,3,5,7,9,10,12,13) and convert it into POS form. (h) Reduce F.m(1,3,7.11,15) + Zd(0,2,5) (Hint: d="Don't Care Condition, acts as 1) (i) Obtain (i) minimal SOP & (ii) minimal POS for Zm(0.2,3.6,7) 4+ []d(8,10,11,15). 4--Answer the following questions (a) Using Boolean algebra, verify the following (1) (A+ B)(B +.C)(C +A) = AB + BC + CA (2) (A+ B)A+ 0) = AC + AB + BC (b) 1 AB + AB = C, show that AC + AC = (c) Simplify y = A+ AB + ABC + ABCD (a) 1 AB + CB = 0, then prove that AB + C(A +) = AB+RD + HD + ACD. (¢) Prove that BCD + ACD + ABD = BCD + ACD + ABC. (2) Find the compiement expression of y = ABC + ABC + ABC + ABC. (g) Prove that ABC + ABC + ABC + ABC + ABC = A+B + (h) Prove that (4 + B)(4C +C)(B + AC) = AB. (i Simplify y = Ac(ABD) + ABCD + ABC. () Simplify y = B+ O)GI+B + C)- « ) Simplify y = AB + ‘ABC + A(B + AB). ‘oblems on conversion to various number systems ia) Convert the following decimal numbers to binary, (1) 167 (2) 72.45 _ (3) 0.4475 (4) 4097.188 (5) 2048.0625 (b) Convert the following bin: (3) 10007101 (2) 10111.1011 (2.011011 (ays rors tot ary numbers to decimal(A Convert the following hexadecimal numbers to decimal & then to binary,- (1) (ABO), (2) (BC2)i6 (3) (FFF)i6 (A)(54A)s6 (4) Convert the following binary numbers to octal and then to hexadecimal,- (1) 101100110011 (2) 1011101.1011 6. Problems on 1's complement method :- (2) Give the 1’s complement of the following numbers, (1) 1011011 (2) 01010111 (b) Subtract using 1’s complement method,- (4) 1101-1001 § (2) 110110-11001 (3) 1000010-100101 7. Problems on 2's complement method :- (a) Give the 2's complement of the following numbers,- (1) 1010111 (2) 11001101 (b} Perform addition using 2's complement inethod,- (4) 110141110 (2) 39419 (3) 40426 ~_—- (4) +64 &-29 t (5) +49 &-37 (6) -48 & 431 & (7) -64 & +46 (8) -32& -16 (9) -42&-31 (c) Perform subtraction using 2's complement method; (2) +39-(+16) (2) +49-(+32) (8) +62-(+29) J Why do you mean by a ‘Universal Gate’? Which logic gates are calied ‘Universal Gates"? Show how they act as ‘Universal Gates’ by proper diagrams and truth tables, 9¢ Write down the logical analysis of an ‘Inverter’, 10. Construct the following logic gates by using discrete elements. & analyse using proper diagrams, logics and verify using truth tables: (i) AND (ii) OR (iii) NOT ; ; 11. SHOW that how experimentally AND & OR gate can be Constructed using NOR gate and hence verify. Or Show that how AND & OR gate can be constructed using transistors and hence verify 12. Show that how AND & OR gate can be constructed using transistors and hence verify. 3. Explai jistor acts as a switch. ' ; ri ee a the construction of EX-OR gate using basic gates and universal gates. Also show that EX -- OR = EX= WOR. | 15. Answer the following questions on Logic Gates :- BC + AC + AB. (A + B)(A + C)(B + D). La Realise (b) Realise yParam = AB + A+ (B+ C) using NAND gates only. plement y = A + BCD using NAND gates only. (e) Implement y = (A + C)(A + D)(A + B + C) using NOR gates only. (f) Minimize ¥ m(3,4,5,7,9,13,14,15) + ¥d(0,2,8) using K-map and implement the minimized logic function only using NAND gates. (g) Minimize ¥ m(0,1,2,9,11,15) + .d(6,10,14) using K-map and implement the minimized logic function only using NOR gates. (h) A corporation having 100 shares entitles the honour of each share to cast one vote at the share holders meeting. Assume that A has 40 shares, B has 30 shares, C has 20 shares & D has 10 shares. ‘Two-third majority is required to pass a resolution in the share-holders meeting. Each of these four men has a switch to vote depending on the percentage of share. (1) Derive a truth table for the output function. 2 (2) Depict the K-map. (3) Give the function its minimal SOP & minimal POS form. (4) implement the function using basic gates and universal gates. 16. What do you mean by a ‘Combinational Logic Circuit’ and a ‘Sequential Logic Circuit? Describe Half- ‘Adder and Full-Adder with proper diagrams and logics. Best of Luck.