Revision: C++ Boolean Algebra Computer Science (C++) Science (English Medium) Class 12 CBSE
- State Any One Absorption Law of Boolean Algebra and Verily It Using Truth Table.
- Verify the Following Using Boolean Laws : U'+V = U'V'+ U' .V + U.V
- State Demorgan'S Laws of Boolean Algebra and Verify Them Using a Truth Table.
- Derive a Canonical Pos Expression for a Boolean Function G, Represented by the Following Truth Table:
- Derive a Canonical Pos Expression for a Boolean Function Fn, Represented by the Following Truth Truth Table:
- Derive a Canonical Pos Expression for a Boolean Function F, Represented by the Following Truth Table
- Reduce the Following Boolean Expression to Its Simplest Form Using K-map: `G(U, V,W, Z) = Sum(3,5 , 6 , 7 , 11 , 12 ,13, 15)`
- Reduce the Following Boolean Expression to Its Simplest Form Using K-map: `E (U, V, Z, W) = Sum (2, 3 , 6, 8, 9, 10, 11 , 12 , 13 )`
- Reduce the Following Boolean Expression to Its Simplest Form Using K-map `F (X, Y, Z, W) = Sum (0, 1, 4, 5, 6, 7, 8, 9, 11, 15)`
- Draw the Logic Circuit of the Following Boolean Expression (U' + V).(V' + W')
- Draw the Logic Circuit for the Following Boolean Expression: (X'+Y).Z + W'
- Draw the Logic Circuit of the Following Boolean Expression Using Only Nor Gates (A+B).(C+D)
