From f2463542e66d2449e9eb02766aa3171b03fe4468 Mon Sep 17 00:00:00 2001 From: Claude Date: Wed, 18 Nov 2026 03:16:31 +0000 Subject: [PATCH 1/2] Exams phase 4c: 26 more Discrete Mathematics questions MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit One or two new questions for each of the 17 taught lessons, each tagged with its lesson and section, none repeating the 42 already in the bank. Numbers checked by script: 26² x 10³ = 676,000 codes, 10 + 100 PINs, C(5,2) = 10 for x³y² in (x + y)⁵, C(6,3) = 20 by Pascal's rule, ⌈50/12⌉ = 5, K₇ has 21 edges, a height-3 binary tree holds at most 15 vertices, a die averages 3.5, and 10 people make 45 pairs. Right answers are spread 6/7/7/6. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_01EC6Zzt5akQu7TEHdGquZzp --- docs/autopilot.md | 4 +- src/content/discrete-mathematics/questions.ts | 364 ++++++++++++++++++ 2 files changed, 367 insertions(+), 1 deletion(-) diff --git a/docs/autopilot.md b/docs/autopilot.md index e88b32c..9cea228 100644 --- a/docs/autopilot.md +++ b/docs/autopilot.md @@ -56,7 +56,8 @@ The owner's priority since 2026-11-03: proper exam practice. The design, decisio - [x] Theory of Computation: +34 (26 → 60), 2 or 3 for each of the 15 taught lessons, each with `lesson` and (all but the intro) `section`. The bank test now finds a lesson's file through `registry.ts`, since `m1-01-states-symbols.mdx` is the slug `states-symbols-and-transitions`. (PR #91, stacked on #90) - [x] Microprocessors: +34 (10 → 44), 3 for each of the 11 taught lessons (4 for segments), each with `lesson` and (all but one) `section`. (PR #94, stacked on #91) - [x] Computer Organization: +26 (10 → 36), 2 or 3 for each of the 9 taught lessons, each with `lesson` and `section`. (PR #96, stacked on #94) - - Still to do, measured 2026-11-16: Discrete Mathematics 26, Data Structures 20, Computer Networks 9. Advanced Software Engineering (42) is new and left to its authors. + - [x] Discrete Mathematics: +26 (42 → 68), 1 or 2 for each of the 17 taught lessons, each with `lesson` and `section`. (PR #PRNUM) + - Still to do, measured 2026-11-16: Data Structures 20, Computer Networks 9. Advanced Software Engineering (42) is new and left to its authors. - [ ] 4d. Set `lesson`/`section` on the 259 migrated questions. - [ ] 5. Generated questions (subnets, scheduling, Big-O first). - [ ] 6. Account sync for review cards and exam attempts. @@ -92,6 +93,7 @@ Nothing. The exam-stack block (since 2026-11-06, over #68's inline practice ques Newest first. One line per run: date and run, what was done, PR link, merged or open. +- 2026-11-18 06:10 (run A): the owner merged everything on 2026-11-17 (the exam stack #90 to #96, #86, #92, #99, #100), so this phase branches from main again. Exam phase 4c, Discrete Mathematics: +26 questions over all 17 taught lessons (precedence, vacuous truth, contrapositive vs converse, nested quantifiers, composition order, partial orders, proof setups, the base case, strong induction, invariant checks, sum and product rules, binomial and Pascal, pigeonhole, K₇, Euler vs Hamiltonian, tree height, expectation, birthday pairs), numbers checked by script. PR #PRNUM, open. - 2026-11-17 14:50 (run C): from the 2026-11-12 audit, the Computer Organization `bits-and-bytes` unit ladder (124 px too wide at 390 px) now fits. Its captions now sit under their bars in a two-column grid at every width, which also fixes the desktop TB and PB captions wrapping unindented, and "2^0 = 1 bytes" now reads "1 byte". PR #99, open. Its CI check is red only because main is: The Exam Mind's round 7 (#97) renamed a heading that a bank question points at; fixed in PR #100. - 2026-11-17 10:40 (run B): exam phase 4c, Computer Organization: +26 questions over all 9 taught lessons, numbers checked by script (500 GB shown as 465.7, G = 01000111, 2¹⁶ and 2¹² locations, the disk capacity 516,096,000 bytes, 4.2 ms average wait at 7,200 rpm). PR #96, open, stacked on #94. - 2026-11-17 06:10 (run A): exam phase 4c, Microprocessors: +34 questions over all 11 taught lessons, every value checked by script (C8h + 64h flags, CS:IP and segment limits, effective address, MUL/DIV results, XOR case flip, LOOP sum, SP after push/pop, INT 21h vector at 84h). PR #94, open, stacked on #91. diff --git a/src/content/discrete-mathematics/questions.ts b/src/content/discrete-mathematics/questions.ts index 54165bd..57a0955 100644 --- a/src/content/discrete-mathematics/questions.ts +++ b/src/content/discrete-mathematics/questions.ts @@ -550,4 +550,368 @@ export const questions: Question[] = [ correctOptionId: "b", explanation: "A topological sort exists exactly when the dependency graph is a DAG. A cycle means some package would have to come before itself.", }, + { + id: "discrete-mathematics/propositions-and-connectives/precedence", + lesson: "propositions-and-connectives", + section: "precedence", + prompt: "How is ¬p ∧ q ∨ r grouped?", + options: [ + { id: "a", text: "¬(p ∧ q) ∨ r" }, + { id: "b", text: "¬p ∧ (q ∨ r)" }, + { id: "c", text: "((¬p) ∧ q) ∨ r" }, + { id: "d", text: "¬(p ∧ q ∨ r)" }, + ], + correctOptionId: "c", + explanation: "¬ binds tightest, then ∧, then ∨, like × before + in arithmetic. So ¬ applies to p alone, ∧ joins ¬p and q, and ∨ comes last. ¬p ∧ (q ∨ r) does the ∨ first, which the rule forbids.", + }, + { + id: "discrete-mathematics/propositions-and-connectives/empty-list", + lesson: "propositions-and-connectives", + section: "implication-the-one-that-trips-everyone-up", + prompt: "A test checks \"every item in the list is positive\". What does it report for an empty list?", + options: [ + { id: "a", text: "It fails, because there are no positive items" }, + { id: "b", text: "It passes, because no item breaks the rule" }, + { id: "c", text: "Neither: the statement has no truth value" }, + { id: "d", text: "It depends on the programming language" }, + ], + correctOptionId: "b", + explanation: "\"For every item, if it's in the list then it's positive\" is an implication with a false hypothesis for every possible item, so it's true. That's vacuous truth: nothing can break the promise. The same rule makes all() of an empty list true in Python.", + }, + { + id: "discrete-mathematics/equivalence-and-laws/converse", + lesson: "equivalence-and-laws", + section: "the-contrapositive", + prompt: "\"If it compiles, the tests ran\" is true. Which statement must also be true?", + options: [ + { id: "a", text: "If the tests ran, it compiled" }, + { id: "b", text: "If it didn't compile, the tests didn't run" }, + { id: "c", text: "It compiles if and only if the tests ran" }, + { id: "d", text: "If the tests didn't run, it didn't compile" }, + ], + correctOptionId: "d", + explanation: "Only the contrapositive, ¬q → ¬p, always means the same as p → q. \"If the tests ran, it compiled\" is the converse and \"if it didn't compile, the tests didn't run\" is the inverse; both can be false while the original is true.", + }, + { + id: "discrete-mathematics/equivalence-and-laws/absorption", + lesson: "equivalence-and-laws", + section: "the-laws", + prompt: "Which law simplifies p ∧ (p ∨ q) to p?", + options: [ + { id: "a", text: "Absorption" }, + { id: "b", text: "De Morgan" }, + { id: "c", text: "Distributive" }, + { id: "d", text: "Domination" }, + ], + correctOptionId: "a", + explanation: "Absorption: p ∧ (p ∨ q) ≡ p. If p is true both sides are true; if p is false the ∧ makes the left false. Distributive would expand it to (p ∧ p) ∨ (p ∧ q), a longer road to the same place.", + }, + { + id: "discrete-mathematics/predicates-and-quantifiers/negate-nested", + lesson: "predicates-and-quantifiers", + section: "nested-quantifiers", + prompt: "What is the negation of ∀x ∃y L(x, y), \"everyone loves somebody\"?", + options: [ + { id: "a", text: "∀x ∃y ¬L(x, y): everyone doesn't love somebody" }, + { id: "b", text: "∃x ∀y ¬L(x, y): someone loves nobody" }, + { id: "c", text: "∀x ∀y ¬L(x, y): nobody loves anyone" }, + { id: "d", text: "∃y ∀x L(x, y): someone is loved by everyone" }, + ], + correctOptionId: "b", + explanation: "Flip each quantifier from the outside in and push the ¬ to the predicate: ∀ becomes ∃, ∃ becomes ∀. \"Nobody loves anyone\" is far stronger than what's needed; one person who loves nobody is enough to break \"everyone loves somebody\".", + }, + { + id: "discrete-mathematics/predicates-and-quantifiers/order-matters", + lesson: "predicates-and-quantifiers", + section: "nested-quantifiers", + prompt: "Over the integers, which statement is true?", + options: [ + { id: "a", text: "∃y ∀x (y > x): some integer is bigger than every integer" }, + { id: "b", text: "Both are true, because they use the same predicate" }, + { id: "c", text: "∀x ∃y (y > x): every integer has a bigger one" }, + { id: "d", text: "Neither is true" }, + ], + correctOptionId: "c", + explanation: "For each x, pick y = x + 1, so ∀x ∃y (y > x) is true. ∃y ∀x needs one y bigger than every x, including y itself, which is impossible. Order matters: ∀∃ lets y depend on x, and ∃∀ doesn't.", + }, + { + id: "discrete-mathematics/sets/cartesian-size", + lesson: "sets", + section: "cartesian-products", + prompt: "|A| = 3 and |B| = 4. How many elements does A × B have?", + options: [ + { id: "a", text: "7" }, + { id: "b", text: "64" }, + { id: "c", text: "81" }, + { id: "d", text: "12" }, + ], + correctOptionId: "d", + explanation: "A × B holds every ordered pair (a, b), so |A × B| = |A| · |B| = 3 × 4 = 12. 7 adds, which counts A ∪ B when they don't overlap; 64 is 4³, the number of functions from A to B.", + }, + { + id: "discrete-mathematics/functions/composition", + lesson: "functions", + section: "composition", + prompt: "f(x) = x + 1 and g(x) = 2x. What is (g ∘ f)(3)?", + options: [ + { id: "a", text: "7" }, + { id: "b", text: "8" }, + { id: "c", text: "6" }, + { id: "d", text: "9" }, + ], + correctOptionId: "b", + explanation: "g ∘ f means g after f: first f(3) = 4, then g(4) = 8. 7 is (f ∘ g)(3) = f(6), the other order, which is the usual mistake: the function written first is applied last.", + }, + { + id: "discrete-mathematics/relations/partial-order", + lesson: "relations", + section: "partial-orders", + prompt: "Which three properties make a relation a partial order?", + options: [ + { id: "a", text: "Reflexive, symmetric and transitive" }, + { id: "b", text: "Reflexive, antisymmetric and transitive" }, + { id: "c", text: "Irreflexive, symmetric and total" }, + { id: "d", text: "Symmetric, antisymmetric and transitive" }, + ], + correctOptionId: "b", + explanation: "A partial order is reflexive, antisymmetric and transitive, like ≤ or \"divides\". Reflexive, symmetric and transitive is an equivalence relation instead. A partial order needn't be total: 2 and 3 are incomparable under \"divides\".", + }, + { + id: "discrete-mathematics/direct-and-indirect-proof/sqrt2-setup", + lesson: "direct-and-indirect-proof", + section: "proof-by-contradiction", + prompt: "The proof that √2 is irrational starts \"Suppose √2 = a/b in lowest terms\". Why lowest terms?", + options: [ + { id: "a", text: "Because the proof then shows a and b are both even, which contradicts having no common factor" }, + { id: "b", text: "Because fractions must always be written in lowest terms" }, + { id: "c", text: "Because it makes a and b prime" }, + { id: "d", text: "It isn't needed; any fraction would do" }, + ], + correctOptionId: "a", + explanation: "From a² = 2b² the proof shows a is even, then b is even. That clash only counts as a contradiction because we assumed a and b share no factor. Without \"lowest terms\" there'd be nothing to contradict.", + }, + { + id: "discrete-mathematics/direct-and-indirect-proof/examples-not-proof", + lesson: "direct-and-indirect-proof", + section: "direct-proof", + prompt: "You check that the sum of two even numbers is even for every pair up to 1,000. What have you shown?", + options: [ + { id: "a", text: "A proof, because 1,000 is a lot of cases" }, + { id: "b", text: "A proof by contradiction" }, + { id: "c", text: "Evidence, not a proof: the claim is about all integers" }, + { id: "d", text: "That the claim is false" }, + ], + correctOptionId: "c", + explanation: "No number of examples proves a claim about infinitely many numbers. The direct proof covers them all at once: a = 2j and b = 2k, so a + b = 2(j + k), which is even. One counterexample, though, is enough to disprove a claim.", + }, + { + id: "discrete-mathematics/induction/skip-base", + lesson: "induction", + section: "how-induction-proofs-go-wrong", + prompt: "For P(n): \"n = n + 1\", adding 1 to both sides shows P(k) → P(k + 1). What's wrong with concluding P(n) for all n?", + options: [ + { id: "a", text: "The inductive step is wrong" }, + { id: "b", text: "Induction only works for inequalities" }, + { id: "c", text: "Nothing: the statement is true" }, + { id: "d", text: "There's no base case, and P(1), \"1 = 2\", is false" }, + ], + correctOptionId: "d", + explanation: "The step really does hold, but it only pushes truth forward. Without a true first domino nothing falls. Checking the base case is what stops a false statement with a valid step from slipping through.", + }, + { + id: "discrete-mathematics/induction/strong", + lesson: "induction", + section: "strong-induction", + prompt: "Proving every integer n ≥ 2 is a product of primes, why is strong induction used instead of ordinary induction?", + options: [ + { id: "a", text: "If k + 1 = a · b, the factors can be any numbers below k + 1, not just k" }, + { id: "b", text: "Because the base case is 2, not 1" }, + { id: "c", text: "Because strong induction proves more things than ordinary induction" }, + { id: "d", text: "Because primes can't be handled by ordinary induction" }, + ], + correctOptionId: "a", + explanation: "The step needs the claim for a and b, which can be anywhere from 2 to k, so the hypothesis must cover every j up to k. Strong induction proves exactly the same things as ordinary induction; it just reaches further back in one step.", + }, + { + id: "discrete-mathematics/loop-invariants/termination", + lesson: "loop-invariants", + section: "the-three-checks", + prompt: "In a loop-invariant proof, what does the termination check show?", + options: [ + { id: "a", text: "That the invariant holds before the first iteration" }, + { id: "b", text: "That each iteration keeps the invariant true" }, + { id: "c", text: "That the invariant, plus the reason the loop stopped, gives the result you wanted" }, + { id: "d", text: "That the loop runs in O(n) time" }, + ], + correctOptionId: "c", + explanation: "The three checks are initialisation (true at the start), maintenance (kept by each pass) and termination (when the loop ends, the invariant plus the exit condition give the answer). Showing that the loop does stop is a separate argument.", + }, + { + id: "discrete-mathematics/sum-and-product-rules/plates", + lesson: "sum-and-product-rules", + section: "the-product-rule", + prompt: "A code is 2 letters (A to Z) followed by 3 digits (0 to 9), repeats allowed. How many codes are there?", + options: [ + { id: "a", text: "676,000" }, + { id: "b", text: "36⁵" }, + { id: "c", text: "1,000 + 676" }, + { id: "d", text: "26 × 2 + 10 × 3" }, + ], + correctOptionId: "a", + explanation: "Each position is filled \"and then\" the next, so multiply: 26 × 26 × 10 × 10 × 10 = 676,000. 36⁵ lets every position be a letter or a digit. Adding is for \"or\": one kind of choice or another.", + }, + { + id: "discrete-mathematics/sum-and-product-rules/one-or-two", + lesson: "sum-and-product-rules", + section: "the-sum-rule", + prompt: "How many PINs are 1 or 2 digits long (0 to 9 each, repeats allowed)?", + options: [ + { id: "a", text: "100" }, + { id: "b", text: "20" }, + { id: "c", text: "1,000" }, + { id: "d", text: "110" }, + ], + correctOptionId: "d", + explanation: "A 1-digit PIN or a 2-digit PIN: those don't overlap, so add. 10 one-digit PINs plus 10 × 10 = 100 two-digit ones is 110. 100 counts only the 2-digit ones; 20 adds 10 + 10.", + }, + { + id: "discrete-mathematics/permutations-and-combinations/binomial", + lesson: "permutations-and-combinations", + section: "the-binomial-theorem", + prompt: "What is the coefficient of x³y² in (x + y)⁵?", + options: [ + { id: "a", text: "5" }, + { id: "b", text: "6" }, + { id: "c", text: "10" }, + { id: "d", text: "20" }, + ], + correctOptionId: "c", + explanation: "Each term picks y from exactly 2 of the 5 brackets, and there are C(5, 2) = 10 ways to choose which. That's row 5 of Pascal's triangle: 1, 5, 10, 10, 5, 1.", + }, + { + id: "discrete-mathematics/permutations-and-combinations/pascal", + lesson: "permutations-and-combinations", + section: "pascals-triangle", + prompt: "C(5, 2) = 10 and C(5, 3) = 10. What does Pascal's rule give for C(6, 3)?", + options: [ + { id: "a", text: "20" }, + { id: "b", text: "100" }, + { id: "c", text: "15" }, + { id: "d", text: "10" }, + ], + correctOptionId: "a", + explanation: "C(n, k) = C(n − 1, k − 1) + C(n − 1, k), so C(6, 3) = C(5, 2) + C(5, 3) = 10 + 10 = 20. Each entry of the triangle is the sum of the two above it, not their product.", + }, + { + id: "discrete-mathematics/pigeonhole-principle/months", + lesson: "pigeonhole-principle", + section: "the-general-version", + prompt: "50 people are in a room. What is the largest number you can be sure share a birth month?", + options: [ + { id: "a", text: "2" }, + { id: "b", text: "5" }, + { id: "c", text: "4" }, + { id: "d", text: "12" }, + ], + correctOptionId: "b", + explanation: "50 items in 12 boxes: some box holds at least ⌈50/12⌉ = ⌈4.17⌉ = 5. If every month had 4 or fewer, there'd be at most 48 people. 4 forgets to round up.", + }, + { + id: "discrete-mathematics/pigeonhole-principle/remainders", + lesson: "pigeonhole-principle", + section: "a-few-more", + prompt: "What is the smallest number of integers that guarantees two of them have the same remainder mod 5?", + options: [ + { id: "a", text: "5" }, + { id: "b", text: "10" }, + { id: "c", text: "6" }, + { id: "d", text: "25" }, + ], + correctOptionId: "c", + explanation: "There are 5 possible remainders (0 to 4), which are the boxes. With 5 integers they could all differ, but 6 integers in 5 boxes force two into one box.", + }, + { + id: "discrete-mathematics/graphs/complete-graph", + lesson: "graphs", + section: "special-graphs", + prompt: "How many edges does the complete graph K₇ have?", + options: [ + { id: "a", text: "42" }, + { id: "b", text: "7" }, + { id: "c", text: "49" }, + { id: "d", text: "21" }, + ], + correctOptionId: "d", + explanation: "Every pair of vertices has one edge, so count the pairs: C(7, 2) = 7 × 6 / 2 = 21. 42 counts each edge twice, once from each end; 49 includes loops and both directions.", + }, + { + id: "discrete-mathematics/paths-and-dags/euler-circuit", + lesson: "paths-and-dags", + section: "euler-paths-every-edge-once", + prompt: "A connected graph has vertex degrees 2, 4, 4, 2. What can you say?", + options: [ + { id: "a", text: "It has an Euler circuit, because every degree is even" }, + { id: "b", text: "It has an Euler path but no circuit" }, + { id: "c", text: "It has no Euler path" }, + { id: "d", text: "You can't tell without trying every route" }, + ], + correctOptionId: "a", + explanation: "A connected graph has an Euler circuit exactly when every vertex has even degree, so this one does. An Euler path without a circuit needs exactly 2 odd vertices. The degrees settle it; no search is needed.", + }, + { + id: "discrete-mathematics/paths-and-dags/hamiltonian", + lesson: "paths-and-dags", + section: "euler-paths-every-edge-once", + prompt: "A delivery route must visit every town exactly once. Which problem is that, and how hard is it?", + options: [ + { id: "a", text: "An Euler path, settled by counting odd degrees" }, + { id: "b", text: "A topological sort, done in linear time" }, + { id: "c", text: "A Hamiltonian path, which has no known fast test (it's NP-complete)" }, + { id: "d", text: "A spanning tree, found greedily" }, + ], + correctOptionId: "c", + explanation: "Every vertex once is a Hamiltonian path; every edge once is an Euler path. They sound like twins, but only the Euler question has a simple degree test. Deciding whether a Hamiltonian path exists is NP-complete.", + }, + { + id: "discrete-mathematics/trees/height-capacity", + lesson: "trees", + section: "height", + prompt: "At most how many vertices can a binary tree of height 3 hold?", + options: [ + { id: "a", text: "8" }, + { id: "b", text: "15" }, + { id: "c", text: "7" }, + { id: "d", text: "16" }, + ], + correctOptionId: "b", + explanation: "Level d holds at most 2ᵈ vertices, so heights 0 to 3 give 1 + 2 + 4 + 8 = 2⁴ − 1 = 15. 8 counts only the bottom level, and 7 stops at height 2.", + }, + { + id: "discrete-mathematics/probability-and-expectation/die", + lesson: "probability-and-expectation", + section: "random-variables-and-expectation", + prompt: "What is the expected value of one roll of a fair six-sided die?", + options: [ + { id: "a", text: "3" }, + { id: "b", text: "Any value from 1 to 6" }, + { id: "c", text: "6" }, + { id: "d", text: "3.5" }, + ], + correctOptionId: "d", + explanation: "E[X] = (1 + 2 + 3 + 4 + 5 + 6) / 6 = 21/6 = 3.5. An expected value is a weighted average, so it doesn't have to be a value the die can show.", + }, + { + id: "discrete-mathematics/birthday-problem/pairs", + lesson: "birthday-problem", + section: "why-so-soon", + prompt: "In a group of 10 people, how many pairs could share a birthday?", + options: [ + { id: "a", text: "9" }, + { id: "b", text: "45" }, + { id: "c", text: "10" }, + { id: "d", text: "100" }, + ], + correctOptionId: "b", + explanation: "A match can be between any two people, so count pairs: C(10, 2) = 10 × 9 / 2 = 45. 9 is only \"my birthday against everyone else's\", the intuition that makes the birthday problem surprising.", + }, ]; From b1022020a1e12bc2e2c9652f3468c398c31cbb32 Mon Sep 17 00:00:00 2001 From: Claude Date: Wed, 18 Nov 2026 03:16:35 +0000 Subject: [PATCH 2/2] Log run: PR #101 Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_01EC6Zzt5akQu7TEHdGquZzp --- docs/autopilot.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/autopilot.md b/docs/autopilot.md index 9cea228..a5fb97c 100644 --- a/docs/autopilot.md +++ b/docs/autopilot.md @@ -56,7 +56,7 @@ The owner's priority since 2026-11-03: proper exam practice. The design, decisio - [x] Theory of Computation: +34 (26 → 60), 2 or 3 for each of the 15 taught lessons, each with `lesson` and (all but the intro) `section`. The bank test now finds a lesson's file through `registry.ts`, since `m1-01-states-symbols.mdx` is the slug `states-symbols-and-transitions`. (PR #91, stacked on #90) - [x] Microprocessors: +34 (10 → 44), 3 for each of the 11 taught lessons (4 for segments), each with `lesson` and (all but one) `section`. (PR #94, stacked on #91) - [x] Computer Organization: +26 (10 → 36), 2 or 3 for each of the 9 taught lessons, each with `lesson` and `section`. (PR #96, stacked on #94) - - [x] Discrete Mathematics: +26 (42 → 68), 1 or 2 for each of the 17 taught lessons, each with `lesson` and `section`. (PR #PRNUM) + - [x] Discrete Mathematics: +26 (42 → 68), 1 or 2 for each of the 17 taught lessons, each with `lesson` and `section`. (PR #101) - Still to do, measured 2026-11-16: Data Structures 20, Computer Networks 9. Advanced Software Engineering (42) is new and left to its authors. - [ ] 4d. Set `lesson`/`section` on the 259 migrated questions. - [ ] 5. Generated questions (subnets, scheduling, Big-O first). @@ -93,7 +93,7 @@ Nothing. The exam-stack block (since 2026-11-06, over #68's inline practice ques Newest first. One line per run: date and run, what was done, PR link, merged or open. -- 2026-11-18 06:10 (run A): the owner merged everything on 2026-11-17 (the exam stack #90 to #96, #86, #92, #99, #100), so this phase branches from main again. Exam phase 4c, Discrete Mathematics: +26 questions over all 17 taught lessons (precedence, vacuous truth, contrapositive vs converse, nested quantifiers, composition order, partial orders, proof setups, the base case, strong induction, invariant checks, sum and product rules, binomial and Pascal, pigeonhole, K₇, Euler vs Hamiltonian, tree height, expectation, birthday pairs), numbers checked by script. PR #PRNUM, open. +- 2026-11-18 06:10 (run A): the owner merged everything on 2026-11-17 (the exam stack #90 to #96, #86, #92, #99, #100), so this phase branches from main again. Exam phase 4c, Discrete Mathematics: +26 questions over all 17 taught lessons (precedence, vacuous truth, contrapositive vs converse, nested quantifiers, composition order, partial orders, proof setups, the base case, strong induction, invariant checks, sum and product rules, binomial and Pascal, pigeonhole, K₇, Euler vs Hamiltonian, tree height, expectation, birthday pairs), numbers checked by script. PR #101, open. - 2026-11-17 14:50 (run C): from the 2026-11-12 audit, the Computer Organization `bits-and-bytes` unit ladder (124 px too wide at 390 px) now fits. Its captions now sit under their bars in a two-column grid at every width, which also fixes the desktop TB and PB captions wrapping unindented, and "2^0 = 1 bytes" now reads "1 byte". PR #99, open. Its CI check is red only because main is: The Exam Mind's round 7 (#97) renamed a heading that a bank question points at; fixed in PR #100. - 2026-11-17 10:40 (run B): exam phase 4c, Computer Organization: +26 questions over all 9 taught lessons, numbers checked by script (500 GB shown as 465.7, G = 01000111, 2¹⁶ and 2¹² locations, the disk capacity 516,096,000 bytes, 4.2 ms average wait at 7,200 rpm). PR #96, open, stacked on #94. - 2026-11-17 06:10 (run A): exam phase 4c, Microprocessors: +34 questions over all 11 taught lessons, every value checked by script (C8h + 64h flags, CS:IP and segment limits, effective address, MUL/DIV results, XOR case flip, LOOP sum, SP after push/pop, INT 21h vector at 84h). PR #94, open, stacked on #91.