CBSE Class 12 Computer Science Boolean Algebra Worksheet Set A

Boolean algebra

Boolean algebra:- a modern algebra which uses the set of numbers 0 and 1,the logic numbers used to solved logic problems.

Binary decision:-. The decision which results into yes or no. Also called logical statements or truth function.

Truth table:- a table representing all possible input-output combinations for a given logical problem/expression.

Tautology:-a Boolean expression that always results in true or 1.

Fallacy:-a Boolean expression that always results in false or 0.

Cononical expression :- a Boolean expression having all minterms or maxterms.

Minterm:-product of all the literals(with or without the bar) within the logic system.

Maxterm:-sum of all the literals(with or without the bar) within the logic system.

Karnaugh Map:- it is a graphical representation of the truth table of the given expression.

Logic Gates

Logic gates serve as the building blocks to digital logic circuits using combinational logic. We're going to consider the following gates: NOT gates (also called inverters), AND gates, OR gates, NAND gates, NOR gates, XOR gates, and XNOR gates. 

We'll also discuss the concept of gate deltay.