CS 120 Lecture Notes - Lecture 7: Nand Gate, Nor Gate, Idempotence

• School: Binghamton University
• Department: Computer Science
• Course: CS 120
• Professor: Steven Moore

Document Summary

Logic functions can be represented in numerous ways; only one of these ways is the truth table. Y = a + b where y is the output, a and b are the inputs, and + is or. Buffer and not are the single input gates. For the not gate equation, put a line on top of the input side. The two input gates are and, nand, nor, and or. For the nand gate equation, put a line on top of the input side. For the nor gate equation, put a line on top of the input side. Just like you can not the output, the input can also be changed by not. Bubble pushing: given an and gate with not bubbles on both inputs, the gate can be changed to an or gate, and the bubbles can be pushed to the output instead.