Write the complement of the expression F = A·B′ + C using De Morgan's theorems.
Boolean Algebra
Original Khojo Papers practice question — not from a past board paper.
F = (A + B + C)(A + B′ + C)(A′ + B + C)
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Maxterm 0 is 000, maxterm 2 is 010 and maxterm 4 is 100; in a maxterm a variable appears uncomplemented where its bit is 0.
From the same topic and chapter, at a similar level.
Write the complement of the expression F = A·B′ + C using De Morgan's theorems.
Boolean Algebra
State and verify the absorption law X + X·Y = X using a truth table.
Boolean Algebra
Reduce X·(X + Y) using the laws of Boolean algebra and name the law used.
Boolean Algebra
Convert the Boolean expression F(A, B, C) = Σ(1, 3, 5) into its canonical sum of products form.
Boolean Algebra
Write a recursive Java method to compute the factorial of a non-negative integer n.
Recursion
Reduce F(A, B, C) = Σ(1, 3, 5, 7) using a Karnaugh map.
Karnaugh Maps