EECS 1520 Midterm: Midterm 2 Miscellaneous Notes

• School: York University
• Department: Electrical Engineering and Computer Science
• Course: EECS 1520
• Professor: John Hofbauer

Document Summary

Gate: a device that performs a basic operation on electrical signals. Circuits: gates combined to perform more complicated tasks. Boolean expressions: uses boolean algebra, a mathematical notation for expressing two- valued logic. Logic diagrams: a graphical representation of a circuit; each gate has its own symbol. Truth table: a table showing all possible input values and the associated output values. Functional notation: uses a function name followed by a list of arguments in place of the operands used in boolean expressions (not, and, or) Six types of gates (first three are boolean algebra: not, and, or, xor (exclusive (there isn"t a possibility that two things your connecting can"t be true together, or, nand (not and, nor (not or) Typically, logic diagrams are black and white with gates distinguished only by their shape. A not gate accepts one input signal (0 or 1) and returns the complementary (opposite) signal as output.