CS201-001, Assignment 1 ** You might write the answers on white papers, scan the papers, make a single PDF file and submit it through UR Courses. Your submission must be readable. [5 X 20 = 100] 1. (i) Draw and explain functionality of 3 basic gates, 2 universal gates, XOR and XNOR gates. Show that an OR gate can be implemented using only NAND gates. (ii) Given the basic identities of Boolean algebra, prove that A'B + B'C+AC, = AB' + BC +A'C 2. Given the basic identities of Boolean algebra, prove that (i) (A C)(A' + B)(B + C)-BC, ifAB = 0 and A + B = 1. ABC' + BC' D' + BC + C' D = B + C' D (ii) (i) Use only NAND gates to implement the Boolean function (ii) Use only NOR gates to implement the Boolean function 3. F=AC' + BC. F=AB + BC. Write the truth tables and draw the logic circuits for the following Boolean functions: (i) (ii) 4. F=A+BC, F=AB+C, + D. 5. Simplify the following Boolean functions using K-maps and draw the logic circuits (i) F = ABC' + BC' D' + BC + C' D (ii) F AB'C'D AB'C'D A'B'CD' AB'CD