ITI 1100 Lecture Notes - And Gate, Truth Table, Functional Completeness

• School: University of Ottawa
• Department: Information Technology
• Course: ITI 1100

Document Summary

Lecture 5 - boolean algebra and logic gates (chapter 2 part 3) 3- deriving sop and pos from a truth table. 4- simplifying sop & pos using boolean identities. The half-adder accepts two binary digits on its inputs and produces two binary digits on its outputs: a sum bit and a carry bit. The full-adder accepts two input bits and an input carry and generates a sum output and an output carry. Basic difference between a full and a half adder is that the full adder accepts an input carry. From an arbitrary truth table (next slide) 2- obtain the two level implementation for f without simplification. 5- compare the design obtained in question 4 with the one of question 2. Deriving sop and pos from a truth table. We can use a nand and nor gates to implement all three of the basic operations (and, or, not) They are said to be functionally complete.