Category: 13. Boolean Algebra

Schematic or Graphical Representation of Boolean Expressions: The Boolean expressions can be graphically represented by using logic circuits. These logic circuits can be constructed using solid-state devices called gates, which are capable of switching voltage levels. If x and y are variables, then the basic expressions x ∧ y (AND), x ∨ y (OR) and x’ (NOT)…

There are two types of canonical forms: Disjunctive Normal Forms or Sum of Products or (SOP): A Boolean expression over ({0, 1}, ∨,∧,’) is said to be in disjunctive normal form if it is a join of minterms Example: (x1‘∧x2‘∧x3‘)∨( x1‘∧x2∧x3‘ )∨(x1∧x2∧x3) is a Boolean expression in disjunctive normal form. Since there are three min-terms x1‘∧x2‘∧x3‘,x1‘∧x2∧x3 and…

Consider a Boolean algebra (B, ∨,∧,’,0,1).A Boolean expression over Boolean algebra B is defined as Example: Consider a Boolean algebra ({0, 1, 2, 3},∨,∧,’,0,1). are Boolean expressions over the Boolean Algebra.     A Boolean expression that contains n distinct variables is usually referred to as a Boolean expression of n variables.Backward Skip 10sPlay VideoForward Skip…