CSC 480 Lab #2

"Necessity is the mother of invention" Lab

Purpose

Apply Boolean minimization techniques: Boolean algebra, DeMorgan's Theorem, etc.
Become familiar with the negative logic of NAND and NOR gates (or is that not NAND or not NOR gates?)

Components used

7400 quad 2-input NAND
7402 quad 2-input NOR
7404 hex INVERTER

Pin layouts for these chips are attached.

Please note: The NAND pinout is different than the NOR!

Safety Reminder

For your health and well-being:
Unplug your unit while you work
Power should only be on while exercising your circuit

For your chip's health and well-being:
Do not force chips into the board...
Use the tongs to remove chips from the board.

Lab Problems

This lab focuses on the design of logic using either NAND or NOR gates. Please complete each of the following parts:

  1. Create an inverter circuit using a 2-input NAND gate.
  2. Create an inverter circuit using a 2-input NOR gate.
  3. What logic value do unconnected inputs assume? Test this condition on each gate type: NAND, NOR, and INVERTER
  4. Create a 3-input NAND gate out of two-input NAND gates. 2 hints: 1) a three-input NAND is just the complement of a three-input AND gate, and 2) this is primarily an exercise in the application of DeMorgan's Theorem.
  5. Create a 3-input NOR gate out of two-input NOR gates.
  6. Select one Boolean function from problem 2-14 (a)-(d) in our text.
    Simplify this using a K-Map and implement it using only 2-input NAND gates and INVERTERS, if necessary.
    Simplify your function again, this time using the 0's in your K-Map and the Product of Sums form. Minimize the function and implement it using only 2-input NOR gates and INVERTERS, if necessary.

Please show either your NAND and your NOR implementation of part 6 to the instructor before ripping it, I mean, carefully disassembling it. Speaking of disassembly, please return your chips, wires, logic box, power supply and whatever else, back in the cabinet we are using.

Deliverables

For each lab problem, please describe the following:
Show a truth table for the function.
Show the steps (if any) you took to minimize or derive your circuit, such as: K-Maps, Boolean algebra, DeMorgan's Theorem, Consensus Theorem, etc.
Draw a logic diagram of the logic circuit that you have built.
Please show me the circuits you built in step 6.

Please submit your lab report for grading before leaving.