Part - II - Boolean Algebra
Chapter 2: Chapter 2 · Computer Science · EN medium
From your actual textbook ✓
What does your textbook say about Part - II - Boolean Algebra?
The NOT operator is represented algebraically by the Boolean expression: Y = A Example: Consider the Boolean equation: D = A + ( B . C ) D is equal to (true) if A is or if ( B . C ) is , that is, B = and C = . Otherwise D is equal to (false). The basic logic functions AND, OR, and NOT can also be combined to make other logic operators such as NAND and
📖 Namma Kalvi 11th Computer Science Textbook English Medium · Page 38
Read from the source
Complete lesson
The NOT operator is represented algebraically by the Boolean expression: Y = A Example: Consider the Boolean equation: D = A + ( B . C ) D is equal to (true) if A is or if ( B . C ) is , that is, B = and C = . Otherwise D is equal to (false).
The basic logic functions AND, OR, and NOT can also be combined to make other logic operators such as NAND and
Related topics
Want this shaped for your exam marks?
Get an AI answer grounded in your actual textbook — with the exact page reference.
Ask AI about this topic →