EECS 1520 Lecture Notes - Lecture 7: Xor Gate, Nand Gate, Nor Gate

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1520
• Professor: Avi Cohen

Document Summary

Gates combined to perform harder tasks uses boolean algebra, notation for expressing 2- valued logic. Graphical representation of a circuit, each gate has its own symbol. A tables showing all possible input & output values. Uses a function name followed by a list of arguments in place of the operands used in. Boolean expressions. accepts one input signal (0 or 1) and returns opposite signal as output accepts two input signals, if both are 1, output is 1 otherwise output is 0. Accepts two input signals, if both are 0, output is 0, otherwise output is 1. X= not (and(a,b)) accepts two input signals, if both are 1, the output is 0, otherwise the output is 1. Accepts two inputs, if both are 0, output is 1, otherwise output is 0. The and gate which has an output of 1 if all input values are 1, otherwise output it 0.