(e) QUESTION I (This question is compulsory) (A)Determine the minimal sun-of-peocact expression for the Boolean function

[answerhappygod]

E Question I This Question Is Compulsory A Determine The Minimal Sun Of Peocact Expression For The Boolean Function 1 (38.75 KiB) Viewed 30 times

(e) QUESTION I (This question is compulsory) (A)Determine the minimal sun-of-peocact expression for the Boolean function (1, 2, 3, 9, 10, 11, 17, 18, 19, 25, 27, 31) 4 (4, 20, 23, 26) where d...) represents the don't care terms. (b) Draw out the circuit diagram for a rynchronour SR flipflop, derive its state table and hence, or otherwise, derive its next state equation. (c) Use De Morgan's Theorem to express the following function as a (i) NOR- NOR and (ii) NAND-NAND solution. State the number of NOR/NAND gates required in each solution respectively, assuming that the inputs, and their complements, are available: ARC=AB+AD+C (d) Simplify the following expression using Boolean algebra: KP + KLM+LNO+KNP + KMNO What are the key criteria of logic minimisation, as used in Karnaugh Maps? How relevant are these criteria in PLA design? (f) Describe the main difference between a prime implicant and an essential prime implicant. Give an example of each to support your answer. (g) Using multiple-output minimisation, obtain a minimal realisation for the following multiple-input multiple-output circuit: f(A.B.CD) (4, 6, 8, 9, 12, 13, 14) + d(0) 8(A.B.C.D)=E(5, 7, 12, 13) + d(15) h(A.B.C.D)=E(0, 5, 7, 8, 9) + d(4) where d(...) represents the don't care terms. Page 2 of 5 (4 marks) (6 marks) (5 marks) (5 marks) (5 marks) (5 marks) (6 marks) QI cont'd overleaf