Question

Please solve the problems from Ch1 Q11and Ch2 2b,3,8,12,14a

Digital system

11. Decode the following ASCII messages. (100 1001)2 (010 0000)2 (110 11002 I (110 1111)2 (111 0110)2 (110 0101)2 (a) (010 0000)2 (100 0101)2 (100 0011)2 (100 0101)2 (011 0010)2 (011 0001)2 (011 0101)2 Show transcribed image text 2. Prove the following properties. (a) Prove the distributive property of the AND () operation over the OR (+). (b) Prove that x +n/-: + y. (c) Prove the absorption law (ie, z + zy = z) 3. Consider the following Boolean function: F-z9 +zy: + rys (a) Draw a circuit diagram to obtain the output F (b) Use the Boolean algebra theorems to simplify the output function F into the minimum number of input literals 8. Consider the following Boolean function: F ab+ac+be (a) Represent F in the sum of minterms form. (b) Represent F in the product of maxterms form. 12. Prove that the NOR operation is not associative. 13. Construct the following Boolean functions using NAND gates (b) F abed + be 14. Construct the following Boolean functions using NAND gates F -abc+ abc + abč (a)

Answer 1

1x173 チ380 ASCII cdel 0 1 0 (410 110の2 = dxH+1x32+ 1x8+3x4 : 408 (110111): 1x6y + 1x32+1x8+1x4+/x2+1x3=11昨0 (110 010264+3+4 101E e (010 oooo)2=32. space (100 001)2=6 2+1-67 (13262 (011 0004,-32+16 +1-49三 5o he message is T love ECER45 Truth table- 1-1 by lokiny at s buth tasle ave alserve that

D is AND abe+ abe tabe tabe tabe+abe 5o terms adhich ave assent Rs wintksms noil se

C may or may not be o so assodatiohy can not be applid hor NDE gate 1 using g 3 input amd a input NAND gats myス

wス て