Sign inSign in
ConceptSystems & CS

Full adder

A more complicated digital circuit abstraction built from two half-adders and an OR gate that takes two input numbers and a carry-in, producing a sum and a carry-out.
as Gerald Jay Sussman defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    A more complicated digital logic abstraction built using two half-adders, extra wires, and an or-gate to add three inputs including a carry-in.
    • 7:35Computational Objects
  • Onur Mutlu

    ETH Zürich · Undergraduate

    A combinational circuit that implements binary addition on one column of bits, taking two operand bits and a carry-in, and producing a sum and a carry-out.
    • 1:37:51Digital Design and Computer Architecture - L2: Combinational Logic
  • Lior Nissim

    Tufts University · Graduate

    A circuit that adds three bits together using communicating cell lines or integrated line components to produce sum and carry outputs.
    • 35:44Biomedical Synthetic Biology

Lectures that assume it

1

Connections

12

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.