Difference between revisions of "CSC103: DT's Notes 1"
| Line 788: | Line 788: | ||
<br /> | <br /> | ||
<br /> | <br /> | ||
| + | |||
| + | {| style="width:100%; background:#FFC340" | ||
| + | |- | ||
| + | | | ||
| + | =Logic Gates= | ||
| + | |} | ||
| + | |||
| + | <br /> | ||
| + | Now that Shannon had shown that computing operations (such as arithmetic) could be done with logic, engineers started creating special electronic circuits that implemented the basic logic operations: AND, OR, and NOT. Because the logical operators are ''universal'', i.e. you can create any boolean function by combining the right logical operators with boolean variables, then these special circuits became ''universal'' circuits. We have a special name for them: '''gates'''. | ||
| + | |||
| + | A ''gate'' is simply an electronic circuit that uses electricity and implements a logic function. Instead of using '''True''' or '''False''', though, we find it easier to replace '''True''' by '''1''' and '''False''' by '''0'''. | ||
| + | |||
| + | |||
| + | <br /> | ||
| + | <center>[[Image:LogicGatesAndOrNot.png ]]</center> | ||
| + | |||
| + | <br /> | ||
| + | <br /> | ||
| + | |||
{| style="width:100%; background:#FFC340" | {| style="width:100%; background:#FFC340" | ||
|- | |- | ||
Revision as of 07:50, 10 September 2013
--© D. Thiebaut 08:10, 30 January 2012 (EST)
