--- title: "Logic Circuits That Add and Remember" description: "Half adders and full adders perform binary addition with carries. A static flip-flop stores one bit while powered, using internal feedback to retain its state between updates." canonical: https://lightmysky.com/learn/computing/logic-circuits-that-add-and-remember-mt_zPgkt6zf-i source: https://lightmysky.com/learn/computing/logic-circuits-that-add-and-remember-mt_zPgkt6zf-i.md retrieved: 2026-11-12 --- > **Agent view.** This is the Markdown twin of the page, for tools and assistants. > When to use this site, and the call that answers each job: https://lightmysky.com/agent-instructions.md > API description (OpenAPI 3.1): https://lightmysky.com/openapi.json · Authentication: https://lightmysky.com/auth.md > Pricing: https://lightmysky.com/pricing.md · Catalog: https://lightmysky.com/llms.txt · Full catalog: https://lightmysky.com/llms-full.txt > Every machine-readable file on this domain: https://lightmysky.com/.well-known/ai-catalog.json > Ask for Markdown with `Accept: text/markdown`, a `.md` address, or `?mode=agent`. # Logic Circuits That Add and Remember Half adders and full adders perform binary addition with carries. A static flip-flop stores one bit while powered, using internal feedback to retain its state between updates. Subject: Computing · Area: Computer Systems · Ages 16 to 17 Page: https://lightmysky.com/learn/computing/logic-circuits-that-add-and-remember-mt_zPgkt6zf-i ## Ready when they can - Give the sum and carry a full adder produces for each combination of its three inputs - Chain full adders to add two unsigned four-bit numbers and identify a final carry beyond the four-bit result - Explain what a static flip-flop holds and how internal feedback retains its state between updates ## Lesson: Circuits that add and remember The Boolean operations you studied can build a half adder. For input bits A and B, carry = A AND B; sum = (A OR B) AND NOT (A AND B). Each operation can be a gate. The half adder adds two bits, giving a sum for this column and a carry for the next column left. Totals 0, 1 and 2 are binary 00, 01 and 10: the right bit is sum and the left bit is carry. A full adder has three inputs: the two bits in its column and a carry in from the column on its right. The carry in counts as one more bit in this column. Its outputs are the sum bit and carry out. Unlike a full adder, a half adder has no carry-in input. **Example.** Add all three full-adder inputs before choosing its outputs. Write the total in binary: its right bit is the sum and its left bit is carry out. For inputs 1, 0 and carry in 1, the total is 2: sum 0 and carry out 1. The table below lists inputs A, B, carry in, followed by sum and carry out. **Example.** For unsigned four-bit addition, start at the rightmost column with carry in 0. Add that column's two bits and carry in. Write its sum bit and pass its carry out left. Repeat for all four columns. For 0011 + 0010, the column totals from right to left are 1, 2, 1 and 0. The result is 0101 with final carry 0. Unsigned four-bit values range from 0 to 15. A final carry of 1 means the exact sum needs a fifth bit. For 1100 + 0101, the exact result is 10001, but the four sum bits are 0001. Keeping only those four bits discards the carry. This is unsigned overflow; signed arithmetic uses a different overflow test. In a ripple-carry adder, connect each column's carry out to the next column's carry in on the left. Set the rightmost carry in to 0 for ordinary addition. Forcing every carry in to 0 loses carries needed by later columns. Leaving an input electrically unconnected is different: its value may be unpredictable. A static flip-flop stores one bit while powered. Internal feedback maintains its state between updates. It is not a wire from the external output to the external data input. A D flip-flop copies its data input at the active clock edge, then holds that bit until another update. If its data input changes between edges, its stored output stays the same. **Recap.** Add each column and pass its carry left. A final carry flags unsigned overflow. A powered static flip-flop holds one bit between updates. *Lesson, questions and flashcards written for this dataset.* ## Practice 8 questions on this page, each with its working shown. ## Needs first - [Boolean Algebra and Simplifying Logic Expressions](https://lightmysky.com/learn/computing/boolean-algebra-and-simplifying-logic-expressions-mt_9MrE1N63D5) ## Optional connections - [Adding Binary Numbers and Overflow](https://lightmysky.com/learn/computing/adding-binary-numbers-and-overflow-mt_dBS2OoQscq) ## Opens up - [Assembly Language and the Instruction Set](https://lightmysky.com/learn/computing/assembly-language-and-the-instruction-set-mt_bzmsfvdzwp) - [Finite State Machines and What They Recognise](https://lightmysky.com/learn/computing/finite-state-machines-and-what-they-recognise-mt_gIk7tQ229w)