(a) Simplify the following logic functions using Boolean Algebra. F=Y+XZ + XYZ (i) (ii) F=Y[(X+Y)(Y+Z)] (b)...

 

Transcribed Image Text:

(a) Simplify the following logic functions using Boolean Algebra. F=Y+XZ + XYZ (i) (ii) F=Y[(X+Y)(Y+Z)] (b) Express Z in canonical form for the truth table in Fig. A2. A Z 0 0 1 1 1 1 1 B 0 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 1 1 Fig. A2 1 0 1 (3 marks) (3 marks) (4 marks) A3. A RAM chip has a 13 address lines and 8 data lines. (a) What is its capacity in bits? (b) If this RAM chip is used to implement a RAM memory of 16K x 16 bits, how many RAM chips are required? (2 marks) (c) If the starting memory address of the RAM memory in part (b) is 4000H, sketch the memory map of the RAM memory in part (b). (6 marks) (2 marks) (a) Simplify the following logic functions using Boolean Algebra. F=Y+XZ + XYZ (i) (ii) F=Y[(X+Y)(Y+Z)] (b) Express Z in canonical form for the truth table in Fig. A2. A Z 0 0 1 1 1 1 1 B 0 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 1 1 Fig. A2 1 0 1 (3 marks) (3 marks) (4 marks) A3. A RAM chip has a 13 address lines and 8 data lines. (a) What is its capacity in bits? (b) If this RAM chip is used to implement a RAM memory of 16K x 16 bits, how many RAM chips are required? (2 marks) (c) If the starting memory address of the RAM memory in part (b) is 4000H, sketch the memory map of the RAM memory in part (b). (6 marks) (2 marks)