🔬 Lab
CS 240 Lab 3
Learning Goals & Reflection
CS 240 Lab 3
Learning Goals
Core Goals
Students can:
- Work with multiplexers:
(
)
- Explain the purpose of a multiplexer.
- Design a circuit for an arbitrarily large multiplexer using AND, OR, and NOT gates.
- Give the formula for how many select wires are needed for a multiplexer, and explain why.
- Identify the select line inputs necessary to select the signal on a specific input line of a multiplexer.
- Explain how to use a multiplexer to build a circuit for an arbitrary truth table.
- Work with decoders:
(
)
- Explain the purpose of a decoder.
- Explain what a “1-hot” encoding is and how it differs from binary.
- Explain how the number of inputs and outputs is related for different sizes of decoder.
- Write the truth table for a decoder of a specific size.
- Design a circuit for an arbitrarily large decoder using AND and NOT gates.
- Work with encoders:
(
)
- Explain the purpose of an encoder.
- Explain how the number of inputs and outputs is related for different sizes of encoder.
- Write the truth table for an encoder of a specific size.
- Design a circuit for an arbitrarily large demultiplexer using OR gates.
- Work with demultiplexers:
(
)
- Explain the purpose of a demultiplexer.
- Write the truth table for a demultiplexer of a specific size.
- Explain how the number of inputs and select lines is related for different sizes of demultiplexer.
- Design a circuit for an arbitrarily large demultiplexer using AND and NOT gates.
- Build functional circuits using integrated circuits as components:
(
)
- Explain what “active low” means in a circuit diagram or logic diagram.
- Explain what an enable line is for.
- Build a circuit that has a specific 3-input truth table using a 74151 8x1 multiplexer chip.
Stretch goals
- Work with adders:
(
)
- Explain why a 1-bit adder needs 2 output lines.
- Explain the difference between a half adder and a full adder.
- Design a half-adder using AND and XOR gates.
- Design a full-adder using AND, OR, and XOR gates.
- Explain how to connect multiple 1-bit full adders to produce a multi-bit adder circuit.
- Identify how many inputs and outputs a 4-bit full adder has.
- Explain under what circumstances a carry-out bit indicates overflow for an N-bit adder.
Reflection
Note: Make sure to use the ‘print’ dialog to save this page as a PDF when you’re done.
I’m most confident in (list a few):
I’m least confident in (list a few):
Questions: