Determine minterms of the Boolean function F=A+¬BC.
| Step | Explanation |
|---|---|
| 1. Construct truth table | A B C F 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1 |
| 2. Identify minterms where F=1 | Binary: 001, 100, 101, 110, 111 Decimal: 1,4,5,6,7 F=∑m(1,4,5,6,7) |
| 3. Analyze statements | A: 1,4,6 ✓ B: 5,7 ✓ C: 2,3,7 ✗ D: 1,2,3,4 ✗ |
| 4. Final Answer | A and B only → (B) |



Match List-I with List-II:
| List-I (Counters) | List-II (Delay/Number of States) |
|---|---|
| (A) n-bit ring counter | (I) Number of states is \( 2^n \) |
| (B) MOD-\(2^n\) asynchronous counter | (II) Fastest counter |
| (C) n-bit Johnson counter | (III) Number of used states is \( n \) |
| (D) Synchronous counter | (IV) Number of used states is \( 2n \) |
Choose the correct answer from the options given below: