Answer available
Class 11 · Computer Science · Boolean Algebra
Reduce the Boolean expression X·Y + X·Y′ using the laws of Boolean algebra.
3 marksMediumNumerical
Class 11 · ICSE · Computer Science
Boolean Algebra
Boolean postulates and laws, De Morgan's theorems, canonical SOP and POS forms, and simplification of Boolean expressions.
- Questions
- 6
- PYQs
- 0
- Topics
- 0
Syllabus mapping: ISC syllabus (CISCE)
Questions
6 questions in this chapter.
- Answer available
Class 11 · Computer Science · Boolean Algebra
Simplify the Boolean expression (X + Y)(X + Y′).
3 marksMediumNumerical
- Answer available
Class 11 · Computer Science · Boolean Algebra
Distinguish between the canonical SOP and POS forms of a Boolean expression.
3 marksMediumShort answer
- Answer available
Class 11 · Computer Science · Boolean Algebra
State and prove De Morgan's two theorems using a truth table.
3 marksMediumStructured
- Answer available
Class 11 · Computer Science · Boolean Algebra
Write the dual of the expression X + (Y · Z) and state what the principle of duality says.
3 marksMediumNumerical
- Answer available
Class 11 · Computer Science · Boolean Algebra
State the complement law and the idempotent law of Boolean algebra.
3 marksMediumNumerical