Class 12 · ICSE · Computer Science

Boolean Algebra

Boolean laws, De Morgan's theorems, canonical forms, and the conversion of a truth table to a Boolean expression.

Questions

5 questions in this chapter.

Answer available
Class 12 · Computer Science · Boolean Algebra
State and verify the absorption law X + X·Y = X using a truth table.
3 marksMediumStructured
Answer available
Class 12 · Computer Science · Boolean Algebra
Write the complement of the expression F = A·B′ + C using De Morgan's theorems.
3 marksMediumNumerical
Answer available
Class 12 · Computer Science · Boolean Algebra
Convert F(A, B, C) = Π(0, 2, 4) into its canonical product of sums form.
3 marksMediumNumerical
Answer available
Class 12 · Computer Science · Boolean Algebra
Reduce X·(X + Y) using the laws of Boolean algebra and name the law used.
3 marksMediumNumerical
Answer available
Class 12 · Computer Science · Boolean Algebra
Convert the Boolean expression F(A, B, C) = Σ(1, 3, 5) into its canonical sum of products form.
3 marksMediumNumerical