CT212-Week-4-Lab-4
Lab 4: Boolean Algebra and DeMorgan’s Theorem Grantham University This study source was downloaded by from CourseH on :49:09 GMT -06:00 Introduction: A logic diagram or schematic drawing, such as those you create in Multisim, is one way to represent logic functions. A truth table, which shows which combinations of inputs produce a 0 or 1, is another way. Boolean algebra is a third way. Boolean algebra is a means of representing and analyzing logic expressions, and uses variables and operators, much like mathematical equations, to represent logic expressions. Boolean algebra typically represents the AND function as a product, the OR function as a sum, and the invert function with an overbar over the inverted term. Two additional theorems for working with Boolean expressions are DeMorgan’s theorems. These theorems mathematically verify that NAND gates are equivalent to negative-OR gates, and that NOR gates are equivalent to negative-AND gates. In this experiment we will verify the validity of the 12 rules of Boolean algebra and verify the validity of DeMorgan’s theorems. Equipment/Components: Multisim Files Digital_Exp_04_Part_01a through Digital_Exp_04_Part_01q. Digital_Exp_04_Part_02a Digital_Exp_04_Part_02b. Procedure: 4.0 Laws of Boolean Algebra 1) Open the file. 2) Verify that the logic driving each probe corresponds to the indicated logic expression. 3) Run the simulation. 4) Set the circuit switches to each setting listed in the circuit file. 5) Specify in the table whether the states for each probe in the circuit are identical for all switch positions. 6) Stop the simulation. 4.1 Rules of Boolean Algebra 1) Open the file. 2) Verify that the logic driving each probe corresponds to the indicated logic expression. 3) Run the simulation. 4) Set the circuit switches to each setting listed in the circuit file. 5) Specify in the table whether the states for each probe in the circuit are identical for all switch positions. 6) Stop the simulation. This study source was downloaded by from CourseH on :49:09 GMT -06:00 DeMorgan’s Theorems 4.2 NAND Gate Equivalent 1) Open the Multisim file Digital_Exp_04_Part
Written for
- Institution
- Grantham University
- Course
- CT 212
Document information
- Uploaded on
- January 9, 2022
- Number of pages
- 8
- Written in
- 2021/2022
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
-
ct212 week 4 lab 4
-
rules of boolean algebra
-
stop the simulation