(a) State and prove De Morgan's theorem using Boolean algebra. (b) Design a 4-to-1 multiplexer circuit and explain its working principle. (c)…

(a) State and prove De Morgan's theorem using Boolean algebra.

(b) Design a 4-to-1 multiplexer circuit and explain its working principle.

(c) Explain the race-around condition in Flip-Flops and discuss how it can be resolved.

(d) Distinguish between Mealy and Moore machines.

From the BCS Technical Cadre (ICT) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 99 of 106.

More from this paper