arrow
arrow
arrow
Match the LIST – I with LIST – II.​List – I​(Boolean Algebra Law)​​List – II(Axioms)​A.Absorption LawI.​a+1=1a+1=1a+1=1​​B.Bounded LawII.​a+0=aa+0=aa+
Question

Match the columns.

Match the LIST – I with LIST – II.


List – I
(Boolean Algebra Law)

List – II
(Axioms)

A.
Absorption Law
I.
a+1=1a+1=1​​
B.
Bounded Law
II.
a+0=aa+0=a​​
C.
Identity Law
III.
a(b+c)=(ab)+(ac)a^{*}(b+c)=(a^{*}b)+(a^{*}c)​​
D.
Distributive Law
IV.
a+(ab)=aa+(a^{*}b)=a​​

Choose the correct answer from the options given below:

A.

A-IV, B-I, C-II, D-III

B.

A-IV, B-III, C-I, D-II

C.

A-III, B-IV, C-II, D-I

D.

A-II, B-III, C-IV, D-I

Correct option is A

We are asked to match the Boolean Algebra Laws with their corresponding axioms.
A. Absorption Law:
• The Absorption Law in Boolean algebra states:
a+(ab)=aa + (a \cdot b) = a​​
• This matches with IV. a+(ab)=a\bf{a + (a \cdot b) = a}​, which is the axiom corresponding to the Absorption Law.
B. Bounded Law:
• The Bounded Law in Boolean algebra states:
a+0=aanda1=aa + 0 = a \quad \text{and} \quad a \cdot 1 = a​​
• This matches with I. a + 0 = a, which is the axiom corresponding to the Bounded Law.
C. Identity Law:
• The Identity Law in Boolean algebra states:
a+1=1anda0=0a + 1 = 1 \quad \text{and} \quad a \cdot 0 = 0​​
• This matches with II. a + 1 = 1, which is the axiom corresponding to the Identity Law.
D. Distributive Law:
• The Distributive Law in Boolean algebra states:
a(b+c)=(ab)+(ac)a \cdot (b + c) = (a \cdot b) + (a \cdot c)​​
• This matches with III. a(b+c)=(ab)+(ac)\bf{a \cdot (b + c) = (a \cdot b) + (a \cdot c)}​, which is the axiom corresponding to the Distributive Law.
Information Booster:
1. Absorption Law
allows simplification of Boolean expressions by eliminating redundant terms.
2. Bounded Law establishes the identity elements for the operations of addition (0) and multiplication (1).
3. Identity Law ensures that certain operations (adding 1 or multiplying by 0) have a consistent result.
4. Distributive Law allows us to "distribute" one operation over another, making it easier to simplify complex Boolean expressions.

test-prime-package

Access ‘UGC NET Computer Science’ Mock Tests with

  • 60000+ Mocks and Previous Year Papers
  • Unlimited Re-Attempts
  • Personalised Report Card
  • 500% Refund on Final Selection
  • Largest Community
students-icon
222k+ students have already unlocked exclusive benefits with Test Prime!

Free Tests

Free
Must Attempt

UGC NET Paper 1 Held on 25 June 2025 Shift 1

languageIcon English
  • pdpQsnIcon50 Questions
  • pdpsheetsIcon100 Marks
  • timerIcon60 Mins
languageIcon English
Free
Must Attempt

Elizabethan Drama

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English
Free
Must Attempt

Concepts, Terms, and Ideas

languageIcon English
  • pdpQsnIcon10 Questions
  • pdpsheetsIcon20 Marks
  • timerIcon12 Mins
languageIcon English