Assignment 1 Computer System Architecture (CSA-301) 1. What is Von-Neumann Architecture? How it differs from Harvard Architecture? 2.

What is XNOR gate? Draw its truth table. 3. What is Opcode? Give an example. 4. How NAND gate can be used as (OR, AND & NOT) gate? 5. Show NOR gate as OR gate. 6. Which gate produces HIGH output when both the inputs are at same logic? 7. Explain with logic diagram working of full-adder. 8. Prove the following: (a) A + AB = A+B (b) (A.B) = A + B 9. Simplify followings using Boolean algebra: (a) A + A.B + AC (b) (A+B+C)(A+B+D+E)(C+D) 10.Map the following SOP expressions on K-map: (a) ABC + ABC + ABC (b) WXYZ + WXYZ + WXYZ 11.Map following POS expressions on K-Map (a) (W+X+Y) (W+X+Y) (W+X+Y) (b) (A + B + C + D) (A + B + C + D) ( A + B + C + D) (A + B + C + D) 12.Reduce following Boolean equations using K-Map and implement it using universal gates: (a) F (ABCD) = m (0,3,7,8,10,12,13) (b) F (WXYZ) = m (1,2,3,5,8,9,14,15)