1. © 2006 Baylor University Slide 1 Fundamentals of Engineering Analysis EGR 1302 Unit 4, Lecture E Approximate Running Time is 20 Minutes Distance Learning / Online Instructional Presentation Presented by Department of Mechanical Engineering Baylor University Procedures: 1.Select “Slide Show” with the menu: Slide Show|View Show (F5 key), and hit “Enter” 2.You will hear “CHIMES” at the completion of the audio portion of each slide; hit the “Enter” key, or the “Page Down” key, or “Left Click” 3.You may exit the slide show at any time with the “Esc” key; and you may select and replay any slide, by navigating with the “Page Up/Down” keys, and then hitting “Shift+F5”.

2. © 2006 Baylor University Slide 2 Boolean Operators Create a Boolean Expression or a Logic circuit from a Truth Table

3. © 2006 Baylor University Slide 3 Logic Circuits and Truth Tables abcf 000 001 010 011 100 101 110 111 2 n inputs = 8 abcf 0000 0010 0100 0110 100 101 110 111 abcf 0000 0010 0100 0110 1000 1010 110 111 abcf 0000 0010 0100 0110 1000 1010 1101 1111

4. © 2006 Baylor University Slide 4 Truth Tables from Boolean Expressions abcf 000 001 010 011 100 101 110 111 1 0 1 0 1 0 0 0

5. © 2006 Baylor University Slide 5 Determine the Boolean Expression from a Truth Table abcf 000 001 010 011 100 101 110 111 abcf 0001 0011 0100 0110 1001 1010 1100 1110 “Disjunctive Normal Form” same technique as “Sum of Products” 6 AND gates, 2 OR gates, 7 inverters 3 gates

6. © 2006 Baylor University Slide 6 The Advantages of the NOR Gate

7. © 2006 Baylor University Slide 7 The Advantages of the NOR Gate The NOR gate can be used to create any gate logic.

8. © 2006 Baylor University Slide 8 Exclusive OR XOR We do not define an operator symbol per our text. “Disjunctive Normal Form”

9. © 2006 Baylor University Slide 9 Truth Table, Boolean Expression, Logic Circuit abcf 000 001 010 011 100 101 110 111 abcf 0000 0010 0101 0110 1001 1011 1101 1110 “Disjunctive Normal Form” The Logic Circuit:

10. © 2006 Baylor University Slide 10 Application of Boolean Algebra needs 13 gates abc 000 001 010 011 100 101 110 111 abc 000010 001111 010111 011100 100111 101111 110111 111100

11. © 2006 Baylor University Slide 11 This concludes Unit 4, Lecture E