Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Digital Logic Number Representations and Computer Arithmetic Minimization of Boolean Expression
निम्नलिखित का मिलान कीजिए:
| सूची I | सूची II |
| A. पहचान विधि | I. A (A + B) = A, A + A ∙ B = A |
| B. वितरण विधि | II. 1 ∙ A = A, 0 + A = A |
| C. अवशोषण विधि | III. (A ∙ B)’ = A’ + B’, (A + B)’ = A’ ∙ B’ |
| D. डी मॉर्गन विधि | IV. (A ∙ B) C = A (B ∙ C), (A + B) + C = A + (B + C) |
1
A - III, B - IV, C - I, D - II
2
A - II, B - IV, C - I, D - III
3
A - I, B - IV, C - II, D - III
4
A - II, B - I, C - IV, D - III