Flashcard Deck · 22 cards · Public

MIT 6.004 - Computation Structures: Digital Logic & CPU Design

Master the foundational principles of computer architecture with this high-yield flashcard deck for MIT 6.004. Dive deep into digital logic, CPU design, and memory hierarchy to understand how hardware executes software at its most fundamental level.

Cards in this deck

(22 cards)

Preview terms and definitions before starting your study session.

#1
Term
What is Boolean Algebra?
Definition
A branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. It is fundamental for designing digital circuits, using logical operations like AND, OR, and NOT.
#2
Term
List the three fundamental Boolean operations and their common symbols.
Definition
1. AND: or
2. OR:
3. NOT: ar{A} or
#3
Term
Describe the function of an AND gate and provide its truth table.
Definition
An AND gate outputs 1 (true) only if all of its inputs are 1. Otherwise, it outputs 0.
Truth Table (2-input):
| A | B | Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
#4
Term
Describe the function of an OR gate and provide its truth table.
Definition
An OR gate outputs 1 (true) if at least one of its inputs is 1. It outputs 0 only if all inputs are 0.
Truth Table (2-input):
| A | B | Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
#5
Term
Describe the function of a NOT gate (inverter) and provide its truth table.
Definition
A NOT gate has a single input and a single output. It outputs the inverse of its input: if the input is 1, the output is 0, and vice versa.
Truth Table:
| A | Y |
|---|---|
| 0 | 1 |
| 1 | 0 |
#6
Term
What are NAND and NOR gates, and why are they considered "universal gates"?
Definition
  • NAND: NOT AND. Outputs 0 only if all inputs are 1.
  • NOR: NOT OR. Outputs 1 only if all inputs are 0.
They are "universal gates" because any other logic gate (AND, OR, NOT, XOR) can be constructed solely using NAND gates or solely using NOR gates.
#7
Term
Differentiate between combinational and sequential circuits.
Definition
  • Combinational Circuits: Outputs depend only on the current inputs. They have no memory or feedback loops. Examples: adders, multiplexers, decoders.
  • Sequential Circuits: Outputs depend on both current inputs and past inputs (i.e., their current state). They incorporate memory elements (latches, flip-flops) and feedback. Examples: counters, registers, FSMs.
#8
Term
Explain the purpose of a multiplexer (MUX).
Definition
A multiplexer (MUX) is a combinational circuit that selects one of several input lines and routes it to a single output line. The selection is controlled by a set of select inputs. An -input MUX requires select lines.
Showing 8 of 22 cards in this deck.
Study All Now