CS 120 Lecture 8: Review of Gates and Circuits

27 views2 pages

Document Summary

Take the following equations and convert them (use the table to find the output and check your answer) (the answers are in bullet points under the change instructions, highlight to see): A and b and not(c: use or instead of and, not(not(a) or not(b) or c) Not(a) or not(not(b)) or c: use and instead of or, not(a and not(b) and not(c)) (a and b) or c, switch the and / or, not((not(a) or not(b)) and not(c)) Putting transistors together makes a gate, not a circuit. P-gate opens (stops flow) when input is 1, and closes when input is 0. N-gate opens when input is 0, and closes when input is 1. Power/ground: the transistors get connected to either power or ground when building a gate. Truth tables: putti(cid:374)g e(cid:448)ery state of the i(cid:374)puts a(cid:374)d (cid:449)hat output they"ll (cid:373)ake i(cid:374)to a table, like the o(cid:374)e above. Boolean equations: + = or gate, * = and gate.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions