वह तालिका जो किसी बूलियन व्यंजक के सभी संभावित इनपुट संयोजनों के लिए तार्किक संचालन के आउटपुट को दर्शाती है, कहलाती है:

Arrange the following operators used in Boolean expressions in order of precedence from highest to lowest: (i) OR (ii) Parentheses (iii) NOT (iv) AND

Which of the following Boolean logic equivalences is NOT true?

Match List I with List II by matching the Boolean algebra theorem/law with its corresponding expression: List I (Theorem / Law) A. Absorption Law B. Commutative Law C. De Morgan's Theorem D. Idempotence Law List II (Boolean algebra) I. X + X = X II. X · Y = Y · X III. X + XY = X IV. (X + Y)' = X'Y'