1 / 7

Boolean Expressions

Boolean Expressions. Lecture No. 10. Boolean Expressions. Boolean expressions are composed of Literals – variables and their complements Logical operations Examples F = A.B'.C + A'.B.C' + A.B.C + A'.B'.C' F = (A+B+C').(A'+B'+C).(A+B+C) F = A.B'.C' + A.(B.C' + B'.C). literals.

john
Download Presentation

Boolean Expressions

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Boolean Expressions Lecture No. 10

  2. Boolean Expressions Boolean expressions are composed of Literals – variables and their complements Logical operations Examples F = A.B'.C + A'.B.C' + A.B.C + A'.B'.C' F = (A+B+C').(A'+B'+C).(A+B+C) F = A.B'.C' + A.(B.C' + B'.C) literals logic operations ECE 301 - Digital Electronics

  3. Boolean Expressions Boolean expressions are realized using a network (or combination) of logic gates. Each logic gate implements one of the logic operations in the Boolean expression Each input to a logic gate represents one of the literals in the Boolean expression A B f logic operations literals ECE 301 - Digital Electronics

  4. Boolean Expressions Boolean expressions are evaluated by Substituting a 0 or 1 for each literal Calculating the logical value of the expression A Truth Table specifies the value of the Boolean expression for every combination of the variables in the Boolean expression. For an n-variable Boolean expression, the truth table has 2n rows (one for each combination). ECE 301 - Digital Electronics

  5. Boolean Expressions Example: Evaluate the following Boolean expression, for all combination of inputs, using a Truth table. F(A,B,C) = A'.B'.C + A.B'.C' + A.C ECE 301 - Digital Electronics

  6. Boolean Expressions Two Boolean expressions are equivalent if they have the same value for each combination of the variables in the Boolean expression. F1 = (A + B)' F2 = A'.B' How do you prove that two Boolean expressions are equivalent? Truth table Boolean Algebra ECE 301 - Digital Electronics

  7. Boolean Expressions Example: Using a Truth table, prove that the following two Boolean expressions are equivalent. F1 = (A + B)' F2 = A'.B' ECE 301 - Digital Electronics

More Related