Q3 Consider the Boolean function F(A, B, C) ((A+B'+C)(A' + C')B)' (i) Construct the full truth table for F. [ 4 marks ]

[answerhappygod]

Q3 Consider The Boolean Function F A B C A B C A C B I Construct The Full Truth Table For F 4 Marks 1 (56.32 KiB) Viewed 15 times

Q3 Consider the Boolean function F(A, B, C) ((A+B'+C)(A' + C')B)' (i) Construct the full truth table for F. [ 4 marks ] (ii) Realize the function F using a minimal number of NAND gates. [ 9 marks (iii) Sketch the output signal when the input signals shown in Figure Q3(a)(iii) are applied to F [ 6 marks ] C B 0 A 0 Figure Q3(a)(iii) (b) Sketch a logic circuit that implements the truth table shown in Table Q3(b) using a minimum number of gates. [ 6 marks ] Table Q3(b) Output Y 0 Inputs А В с 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0 1