Computer Science
Related Questions
State the two absorption laws. Verify any one of them using truth table.
If A = 1, B = 0, C = 1 and D = 1, find its
- maxterm
- minterm
Convert the following cardinal expression into its canonical form and reduce it using Boolean laws:
F(L, M, O, P) = π(0, 2, 8, 10)
Reduce the following Boolean expression into their simplest forms:
- {(CD)' + A} + A + C.D + A.B
- A.{B + C (A.B + A.C)'}