Consider the following in Boolean algebra:
X: a ∨ (b ∧ (a ∨ c)) = (a ∨ b) ∧ (a ∨ c)
Y: a ∧ (b ∨ (a ∧ c)) = (a ∧ b) ∨ (a ∧ c)
The identity a ∨ (b ∧ c) = (a ∨ b) ∧ c is satisfied if
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. Both X and Y are true
Explanation
X and Y are the two dual forms of the modular law, and both hold in every Boolean (distributive) algebra. a ∨ (b ∧ c) = (a ∨ b) ∧ c is the modular identity, valid when a ≤ c; it is the case where both forms apply.More Discrete Structures and Optimization questions
- Given below are two statements: Assertion (A) and Reason (R). Assertion (A): ¬p Reason (R): (r → ¬q, r ∨ s, s → ¬q, p → q) In the light of…
- The prototyping model has the sequence: (A) Customer Evaluation (B) Quick design (C) Requirements (D) Implement (E) Design
- The selection of Spiral Model based on characteristics of requirements: (A) Are requirements easily understandable and defined? (B) Do we c…
- Statement (I): In Reuse Oriented Model, Modification of the old system parts appropriate to the new requirements. Statement (II): In Reuse…
- How do you create agile processes to manage unpredictability? (A) Requirements gathering must be conducted very carefully (B) Risk analysis…
- RAD software process model stands for