Gates in computers work on the same principles as switching circuits. The three basic type...

Gates in computers work on the same principles as switching circuits. The three basic types of gate are the NOT gate, the AND gate, and the OR gate. Each is illustrated along with a table that indicates current flow entering and exiting the gate. If current flows into a NOT gate, then no current exits, and vice versa. Current exits an AND gate only when both inputs have a current flow. Current exits an OR gate if current flows through either, or both, inputs. In the table, a 1 represents a current flow and a 0 indicates no current flow. For example, in the AND gate, if there is a current flow in input A (Ia has a value of 1) and no current flow in input B (Ib has a value of 0), there is no current flow in the output (O has a value of 0); see row 2 of the AND Gate table.

a) If 1 is considered true and 0 is considered false, explain how these tables are similar to the not, and, and or truth tables.

For the inputs indicated in the following figures determine whether the output is 1 or 0.

---

b)

---

c)

---

d)

---

e) What values for Ia and Ib will give an output of 1 in the figure in part (d)? Explain how you determined your answer.

---

f) Construct a truth table using 1’s and 0’s for the following gate. Your truth table should have columns Ia, Ib, and O and should indicate the four possible cases for the inputs and each corresponding output.