advertisement

CSC346 – ENS220 Quiz1 10/17/07 Answer all the questions in detail. Answers without explanation won’t be graded. Answers at the last page (Scratch paper) won’t be graded. 1) Convert the following hexadecimal numbers into binary. a) F53 b) EE2 c) 9012 Answer: 2) Using signed binary representation perform the following operations a) 20 – 40 b) 20 + 40 Answer: 3) Name the different parts of a processor Answer: c) 40 – 20 d) (- 20) – 40 4) Minimize each of each Boolean expression to minimum number of literals (without using k-maps) and draw the corresponding logical circuit of the minimized expression. a) xyz’ + x’yz + xyz + x’yz’ Answer: b) (x + y + z’) (x’ + y’ + z) Answer: c) ABCD + A’ BD + ABC’D (to two literals) Answer: 5) Implement the Boolean function F= xy + x’y’ + y’z using a) AND, OR, and Inverter gates b) OR and Inverter gates 6) Express the Boolean function F(A,B,C,D)= B’D + A’D + BD as a a) Sum of Minterms b) Product of Maxterms 7) Simplify using K-maps the following function (please determine essential prime applicants) F(A,B,C,D) = (0,2,3.5.7,8,9,10,11,13,15) Answer: 8) Simplify F(A,B,C,D) = (1,2,3.5.7,8,9,10,11,13,15) into a product of sums (hint: simplify the 0’s entries to get F’ and then get F back using DeMorgan’s) 9) Given the Boolean function F(w,x,y,z) = (0,3,5,11,15) and the don’t care conditions d(w,x,y,z) = (1,2,7) simplify the function using K-maps. 10) The NAND gate is called the universal gate because any other gate can be implemented using a NAND gate (and Inverter is a single-input NAND gate) a) Show how you can implement an AND gate using NAND gates and Inverters. b) Show how you can implement an OR gate using NAND gates and Inverters. Scratch Paper