ch 4.txt

  1. Name and describe the six boolean gates that can be incorporated into circuits and can be combined to form more sophisticated operations:
    • NOT - one input; inverts the input value
    • AND - true only if both inputs are true
    • OR - true if either (or both) operands are true
    • NAND - true UNLESS both inputs are true (opposite of AND)
    • NOR - true only if both inputs are false (opposite of OR)
    • XOR - true only if ONE AND ONLY ONE input is true
  2. What is a transistor?
    A transistor is a relatively inexpensive mechanism for implementing boolean operators in circuitry.
  3. Describe how to create a NOT gate using transistor(s).
  4. Describe how to create a NAND gate using transistor(s).
  5. Describe how to create a AND gate using transistor(s).
  6. Describe how to create a NOR gate using transistor(s).
  7. Describe how to create a OR gate using transistor(s).
  8. Describe how logic gates can be used to perform simple bit addition.
    • When adding binary digits there are 2 sets of two possibilities; the sum of the two digits can be 0 or 1, and the digit carried can be 0 or 1.
    • Note that the sum bit can be determined using the XOR operation, while the carry bit can be determined using the AND operation.
    • Multiple bit addition can be implemented by extension of this concept.
  9. What is an S-R latch?
Author
dimeng
ID
295299
Card Set
ch 4.txt
Description
Diane cs111 ch4
Updated