(a) Define Boolean algebra. State its fundamental laws and illustrate how these laws are applied to simplify logic expressions. (b) What are…
(a) Define Boolean algebra. State its fundamental laws and illustrate how these laws are applied to simplify logic expressions.
(b) What are combinational and sequential logic circuits? Explain the design procedure of a full adder with its truth table.
(c) Simplify the following Boolean function using K-map and implement it using NAND gates only. F(A, B, C, D) = Σ(3, 5, 7, 9, 11, 13, 14, 15). Show the simplification steps and draw the final logic diagram.
From the BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 106 of 123.
More from this paper
- Previous: (a) Explain Thevenin's theorem. Describe the steps required to find the Thevenin equivalent voltage and resistance of a given linear…
- Next: (a) What are the differences between Harvard and Von Neumann architecture? Explain using a suitable diagram. (b) How does DMA increase…
- All questions in BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC)