Revision: Boolean Algebra Computer Science (Theory) ISC (Commerce) Class 12 CISCE
- Assertion: For proposition ∼A=> B, its contrapositive is B =>∼A. Reason: Contrapositive is the converse of inverse for any proposition.
- The complement of the Boolean expression (P' • Q) (R • S') is ______:
- A shopping mall allows customers to shop using the cash or credit card of any nationalised bank. In awards bonus points to their customers on the basis of criteria given below:
- Verify if (A + A')' is a Tautology, Contradiction or a Contingency.
- Verify the following expression by using the truth table: (A ☉ B)' = A ⊕ B
- Find the complement of the following expression and reduce it by using Boolean laws. P•( 13 ± Q)•Q•(Q+R')
- The reduced expression of the Boolean function F(P, Q) = P' · + P · Q is ______.
- According to the Principle of duality, the Boolean equation A+ B') • (A+ 1) =A+ B' will be equivalent to ______.
- The dual of (X' + 1) · (Y' + 0) = Y' is ______.
- With reference to the code given below, answer the questions that follow along with dry run / working.boolean num(int x)
- Verify if the following proposition is a Tautology, Contradiction or Contingency using a truth table. ((A => B)^(B => C))=>(A => C)
- How is a decoder different from a multiplexer?
- According to De Morgan's law (a +b + c')' will be equal to ______.
- From the logic diagram given below, write the Boolean expression for (1) and (2). Also, derive the Boolean expression (F) and simplify it.
- Write the canonical SOP expression for F (A, B) = A <=> B
- To be recruited as the Principal in a renowned College, a candidate must satisfy any one of the following criteria: The candidate must be a Postgraduate and should either possess a B.Ed. degree
- Convert the following cardinal expression to its canonical form: F(P, Q, R) = π(0, 1, 3, 4).
- Write the cardinal form of the maxterm X + Y' + Z.
- Reduce the Boolean function F (A,B,C,D) = π (0, 2, 4, 6, 8, 9, 10, 11, 14) by using 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs).
- Give the Boolean function F(A, B, C, D,) π(0, 1, 2, 4, 5,8, 10, 11, 14,15). Reduce the above expression by using 4-variable Karnaugh mpa,
- Given the Boolean function F(A, B,C, D,) = ∑(2, 3, 6,7,8,10,12, 14, 15). Reduce the above expression by using 4- variable Karnaugh map, showing the various groups (i.c., octal, quads and pairs.
- Reduce the above expression X (P, S, E, B) by tiifig 4-variable Karnaugh map, showing the various groups (i.e., octal, quads and pairs). Draw the logic gate diagram for the reduced expression. Assume
- Propositional Logic
- Well Formed Formulae
- Truth Values and Interpretation of Well Formed Formulae
- Truth Tables
- Satisfiable
- Unsatisfiable
- Valid Formulae
- Equivalence Laws and Their Use in Simplifying Well Formed Formulaes
- Binary-valued Quantities
- Basic Postulates of Boolean Algebra Operations AND, OR and NOT
- Basic Theorems of Boolean Algebra (Eg. Duality, Idempotence, Commutativity, Associativity, Distributivity, Operations with 0 and 1, Complements, Absorption, Involution)
- DeMorgan’S Law/Theorem and Their Applications
- Reducing Boolean Expression (SOP and POS) to Its Minimal Form
- Use of Karnaugh Map for Minimization of Boolean Expressions (Up to 4 Variables)
