Boolean Algebra in Digital Logic : Practice MCQ Questions & Answers with Explanations

(A + B')(C' + D). Given Boolean function: A'B + CD' + A'B + CD' First simplify the given expression: A'B + A'B = A'B (redundant term) CD' + CD' = CD' (redundant term) So, the simplified function = A'B + CD' Now, we are asked to find the complement of this function: Let F = A'B + CD' Then the complement is: F' = (A'B + CD')' Apply De Morgans Law: (A'B + CD')' = (A'B)' · (CD')' (A'B)' = A + B' (CD')' = C' + D Therefore, F' = (A + B')(C' + D) Hence, the correct answer is:Option 3) (A + B')(C' + D)

correct matching of Boolean Algebra Laws with their corresponding Axioms is as follows: Absorption Law: a + (a b) = a Bounded Law: a + 1 = 1 Identity Law: a + 0 = a Distributive Law: a (b + c) = (a b) + (a c) Based on this, the correct matching is: A - IV (Absorption Law - a + (a b) = a) B - I (Bounded Law - a + 1 = 1) C - II (Identity Law - a + 0 = a) D - III (Distributive Law - a (b + c) = (a b) + (a c)) Additional Information Understanding Boolean Algebra is essential in digital electronics and computer science for designing and analyzing digital circuits. Boolean Algebra allows for the simplification of logic expressions, making it easier to implement and optimize digital systems. These fundamental laws and axioms provide the foundation for more complex theorems and applications in Boolean logic and digital design.