# Lesson 23 Flashcards — Digital Logic

Click a question to reveal the answer.

<div data-flashcards data-deck="b2l23"></div>

<details>
<summary><strong>1. Why is digital representation robust in a way analog is not?</strong></summary>
<div class="card-answer"><p>Only two states are valid, so noise that does not push a value across the decision threshold is <strong>completely removed</strong> when the signal is regenerated. Analog noise accumulates permanently.</p></div>
</details>

<details>
<summary><strong>2. What does digital robustness cost?</strong></summary>
<div class="card-answer"><p>You must <strong>quantize</strong> first, and quantization error never goes away. Digital trades a one-time known error for immunity to every error after it.</p></div>
</details>

<details>
<summary><strong>3. How many values can n bits represent?</strong></summary>
<div class="card-answer"><p><span class="math notranslate nohighlight">\(2^n\)</span>. This is the same relationship as the ADC level count in Objective 2.5 (there we called the exponent <em>b</em>).</p></div>
</details>

<details>
<summary><strong>4. Name the three fundamental logic gates and when each outputs 1.</strong></summary>
<div class="card-answer"><p><strong>NOT</strong> when the input is 0; <strong>AND</strong> when <em>all</em> inputs are 1; <strong>OR</strong> when <em>any</em> input is 1.</p></div>
</details>

<details>
<summary><strong>5. What is special about XOR?</strong></summary>
<div class="card-answer"><p>It outputs 1 when the inputs <strong>differ</strong> — the 'are these different?' gate. It appears throughout arithmetic and error checking.</p></div>
</details>

<details>
<summary><strong>6. How do you tell the gate symbols apart on a circuit diagram?</strong></summary>
<div class="card-answer"><p><strong>AND</strong> has a flat back and a D-shaped nose; <strong>OR</strong> has a curved back and a pointed nose; <strong>NOT</strong> is a triangle. A <strong>bubble</strong> on the output inverts it (NAND, NOR, XNOR), and a <strong>second arc</strong> across the back marks XOR and XNOR.</p></div>
</details>

<details>
<summary><strong>7. How many rows does a truth table with n inputs have?</strong></summary>
<div class="card-answer"><p><span class="math notranslate nohighlight">\(2^n\)</span>. List them in <strong>binary counting order</strong> so you cannot miss one.</p></div>
</details>

<details>
<summary><strong>8. What does <em>combinational</em> mean?</strong></summary>
<div class="card-answer"><p>The output depends only on the inputs <strong>right now</strong>, with no memory of what came before — which is why a truth table specifies it completely. Objective 2.8 adds the memory.</p></div>
</details>

<details>
<summary><strong>9. Why is the truth table considered the ground truth for a circuit?</strong></summary>
<div class="card-answer"><p>Because it is the complete specification. Two circuits with the same truth table are functionally identical, however differently they are built.</p></div>
</details>

<details>
<summary><strong>10. How do you build a truth table for a compound circuit?</strong></summary>
<div class="card-answer"><p>Give <strong>every intermediate wire its own column</strong>, in the order signals are produced, and fill each using only the columns to its left. Holding intermediates in your head is where errors come from. If the drawing does not name a wire, name it yourself and use that as the column head.</p></div>
</details>

<details>
<summary><strong>11. On a circuit diagram, what does a filled dot where wires meet mean?</strong></summary>
<div class="card-answer"><p><strong>Fan-out</strong> — one signal feeding two places, so the same value arrives at both gates and it gets <em>one</em> column in the truth table. Wires that merely cross with no dot are unrelated.</p></div>
</details>

<details>
<summary><strong>12. How do you write a Sum of Products expression?</strong></summary>
<div class="card-answer"><p>For each row where the output is <strong>1</strong>, write a product (AND) of all inputs, complementing any input that is <strong>0</strong> in that row. Then OR those products together.</p></div>
</details>

<details>
<summary><strong>13. How do you write a Product of Sums expression?</strong></summary>
<div class="card-answer"><p>For each row where the output is <strong>0</strong>, write a sum (OR) of all inputs, complementing any input that is <strong>1</strong> in that row. Then AND those sums together. <strong>Note the inversion is opposite to SOP.</strong></p></div>
</details>

<details>
<summary><strong>14. When would you choose POS over SOP?</strong></summary>
<div class="card-answer"><p>When the table has few 0s. Few 1s favors SOP, few 0s favors POS — both describe the same circuit.</p></div>
</details>
