Study

Four courses, eight cards each. Pick a course on the left of the grid and everything below follows it — the deck, the note, the figures. The chart on the right keeps all four in view.

The campus lake under a wide sky

Where I am · Programming III

0/ 8

cards known · 8 to go

Courses
4
Projects
0
Next exam
—

Courses

Marked known

Every card you have marked, by course.

Deck

—
—

Loading…

Exams

Dates from the term record — check Canvas for anything not confirmed.

Math III · unit progress

synced 2026-11-10

3 / 9 units

6.5 sessions left · content done 11/17 · exam 11/24 14:00 · b110

  1. DONE 1 · From a question to statistical data p.7
  2. PART 2 · Reading plots, describing distributions p.9 — centre & spread done, plot construction not yet
  3. TODO 3 · Studies, bias, confounding, causal claims p.11
  4. DONE 4 · Joint, marginal, conditional probability · Bayes p.13
  5. PART 5 · Choosing a distribution (binomial, geometric, Poisson, normal) p.15 — selection logic done, continuous density pending
  6. TODO 6 · Joint random variables, covariance p.17 · Exam D section, 35 marks
  7. TODO 7 · Continuous joint densities, double integrals p.19 — hardest unit, 1.5 sessions
  8. TODO 8 · Sampling distributions, standard error, CLT p.21
  9. TODO 9 · Confidence intervals, hypothesis tests, claims p.26 · Exam E section, 25 marks
Next 7 days (as of 11/10 — superseded by the 11/14 card below)
  • 11/11 — unit 2 plots + unit 3 (bias & confounding)
  • 11/12 — unit 6 joint variables, covariance
  • 11/13 — unit 7 continuous joint densities
  • 11/14 — unit 8 sampling distribution, SE, CLT
  • 11/15–11/17 — unit 9: CI, then hypothesis tests, then the error book
  • 11/18–11/22 — no new content: Part E problem sets, full 120-minute mock on 11/22
Formulas that were missing from my sheet
P(Aᶜ) = 1 − P(A)
P(A|B) = P(A∩B) / P(B)
independent:  P(A∩B) = P(A)·P(B)      mutually exclusive:  P(A∩B) = 0
E(X) = Σ x·p(x)                       V(X) = E(X²) − [E(X)]²
s = √( Σ(x−x̄)² / (n−1) )              population version uses σ
z = (x − µ)/σ                         P(X > x) = 1 − Φ(z)
continuous:  P(X = c) = 0             probability = area, not height

The card ticks above are still yours to click — this block records what the tutoring sessions actually covered, so the two never contradict each other.

Math III · what the 11/13–14 sessions did

synced 2026-11-14

3 / 9 units

units did not move · the method did · exam 11/24 14:00 · b110

  1. RULE Continuous density now has a five-step entry point: mark the support, set total area = 1, integrate only over the support, P(X = c) = 0, then sanity-check. Worked on f(x) = cx over (0, 2): c = 1/2, P(0.5 < X < 1.5) = 0.5.
  2. DECK Unit 6–7 paper written — 45 marks shaped like Exam section D (35 marks): joint table, marginals and independence, Cov and ρ, continuous joint density with a double integral, max(X, Y). File: math-study\unit6-7-joint.html
  3. DEAD The first paper was off-plan and is dropped: it tested regression (in no exam section) and hypothesis tests (unit 9, 11/15–17).
  4. TODO The paper has not been sat. Four one-line normalisations are still unanswered — k = 1/9, 2, 1/3, 1/4.
Plan, 11/14 → 11/24
  • 11/14 — unit 8: sampling distribution, standard error, CLT
  • 11/15–11/17 — unit 9: confidence intervals, then hypothesis tests, then the error book
  • 11/18–11/21 — unit 6 + 7 problem sets from the D-section paper; re-do every wrong answer once
  • 11/22 — full 120-minute mock · 11/24 14:00 · b110

Programming III · paper 01 and the two templates

synced 11/14

100 marks written

11 rules still solid · mock B 4.5 / 10 unchanged · C and D not attempted · exam 11/23 09:00 · b106

  1. PAPER Mock 01 — 120 minutes, A 10 / B 30 / C 30 / D 30, same shape as 卷 C. Every 11/12 mistake is planted: truncation, %, char arithmetic, loop counts, value vs reference, [] without a bounds check, || semantics, constructor/destructor order, the empty vector. File: study\cpp-mock-final-01.html
  2. TEMPLATE A3–A5 now have English sentences to memorise: value vs reference (copy / caller / write back), RAII (owner / destructor / stack unwinding / reverse order), trailing const (this is a pointer to const, so it is callable on a const object).
  3. CHECKLIST Part C scan list, in order: bounds, integer division, empty input, sign, illegal values, condition semantics. The question to ask of every parameter — what if it is 0, empty, negative, or huge?
  4. WORKED C3 walked through: c == 'a' || 'e' is always true because 'e' is a nonzero int, so the function returns s.size() — every character counted as a vowel.
  5. TODO A3–A5 are not memorised yet. No Part C item has been attempted unaided. D's maxOf and Account are still unwritten on paper.
Waiting on four answers
  • for (int i = 0; i <= v.size(); ++i) sum += v[i]; — which checklist line?
  • double avg = sum / n; with both int — which line?
  • if (amount > balance) return false; balance -= amount; with a negative amount — which line?
  • int last = v[v.size() - 1]; on an empty v — which line?

Web · the 48 marks you can memorise

synced 2026-11-14 · from webtech.landrock.io

48 / 100 marks

A 15 + B 15 + E 10 + D3 8 · no code to write · exam 11/20 14:00 · 90 min

Everything below is a fact to say out loud, not to work out. Tick the box when you can say it without looking. Anything still empty the night before is what you revise.

A · How the web works — 15

☐Four inventions, 1989, Berners-Lee, CERN — HTML (HyperText Markup Language) write · HTTP (HyperText Transfer Protocol) send · URL (Uniform Resource Locator) address · the browser read (his was WorldWideWeb)
☐Parts of an address: scheme · host (the domain inside it is who owns it) · port · path · query · fragment — the fragment never reaches the server
☐Status codes: 2xx OK · 301 moved permanently (+ Location) · 404 not found = the requester's mistake · 500 server error = the server's mistake
☐DNS: turns a name into an IP address — the phone book, before any request can be sent
☐The chain: DNS → connect → HTTP request → response with a status code → browser parses HTML → asks again for CSS and images
☐Why standards: one page works in every browser, because they all agree to read the same code
☐Client and server: the browser asks, the server answers — and knows nothing between requests

B · HTML, CSS or JavaScript — 15

☐Three jobs: HTML = structure (walls, rooms) · CSS = presentation (paint, furniture) · JS = behaviour (plumbing, electricity). A page with no CSS is still a page.
☐Shapes: <tag>…</tag> · selector { property: value; } · statements with let const function document =>
☐Typical words: HTML href src alt class id · CSS color margin display font-size · JS let const document fetch
☐Comments: <!-- --> HTML only · /* */ CSS and JS · // JS only — in CSS it is not a comment and it breaks the next rule
☐Files: .html .css .js
☐Inside a page: <style> and style="…" carry CSS · <script> carries JS · <link rel="stylesheet"> and <script src> pull files in — and each of those lines is still HTML
☐Name the language of the line, not of what sits inside its quotes — document.querySelector('.quote') is JavaScript
☐Why separate: one CSS file styles every page · a screen reader reads HTML and ignores paint · you know which file to open · CSS is cached once
☐Progressive enhancement: it works → it looks right → it feels good
☐When it breaks: tags showing or text misplaced = HTML · everything unstyled = the <link> · one rule ignored = that CSS rule · button does nothing = JS, open the Console · nav and footer missing = opened with file://, fetch needs a server · image missing = the path, a 404 · ��� = the charset line · tiny page on a phone = the viewport line

C · Paths and names — 8 (D3)

☐Three rules: all lowercase · forward slashes / never \ · never a path on your own disk
☐Case matters on the server, not on your laptop — Images/ for a folder called images is a 404
☐No spaces in names — a space becomes %20; use -. index.html is the front page of a folder
☐Missing https://: the browser looks for a folder called www.example.com inside your own site
☐Relative vs absolute: images/hero.webp · ../images/hero.webp · about.html#prices · https://… · mailto: · tel:

D · Your project and its tools — 10 (E)

☐favicon 32 × 32 — the tab, bookmarks, history
☐app icon 180 × 180 — the phone's home screen when the site is saved
☐Open Graph image 1200 × 630 — the preview card when a link is shared; it needs the full https:// address
☐Formats: photo = JPEG or WebP · transparency = PNG · logo or icon = SVG · video = MP4, not GIF · font = WOFF2
☐A browser cannot show: .heic .psd .tiff .docx — convert first
☐Git vs GitHub: a program on your machine that records history offline, versus a website that keeps a copy online. Git without GitHub, yes; the other way round, no.
☐add → commit → push: choose · record · send. Only push needs the internet.
☐The page's four parts: header · nav · main · footer — only <main> changes page to page. Also: hero = the first screen of the home page · section · article · cards in a grid · aside · responsive = one page on a phone and on a laptop

Not on the exam, so stop revising it: writing code · reading JavaScript line by line · specificity and inheritance · Vue and frameworks. The remaining 52 marks are reading code (C, 30) and finding errors (D, 30 minus the 8 above).
The pure memorising version — printable, answers hideable — is its own page: Cram →

Programming III · what I learned today

PART I–II concepts cleared · synced 11/12

11 rules now solid

part A cleared · mock B part A 4.5 / 10 → solid on 卷 C · next → part B · exam 11/23 09:00 · b106

  1. RULE int / int truncates — 7 / 2 == 3. One double operand makes it real: 7.0 / 2 == 3.5.
  2. RULE % is the remainder, never the quotient — 7 % 2 == 1, 10 % 3 == 1.
  3. RULE char is an integer: 'A' + 1 == 'B', 'a' + 2 == 'c', 'a' - 'A' == 32, '0' == 48.
  4. RULE Upper bounds are excluded — for (i = 5; i > 0; --i) body runs 5 times, not 6.
  5. RULE cin >> a >> b fills left to right — input 3 4 gives a = 3, b = 4.
  6. RULE [] never bounds-checks: std::vector<int> v; v[0] = 1; is undefined behaviour, not an exception. at() throws; [] does not.
  7. RULE % and / share a precedence level and run left to right — 10 % 3 + 10 / 3 = 1 + 3 = 4.
  8. RULE Truncation happens before the widening — int x = 7/2; double y = x/2; gives 1, not 3.5.
  9. RULE 1 / 2 * 2.0 is 0 — the division is already integer, the later double changes nothing.
  10. RULE Assigning to a double rescues nothing — double d = 1 / 3; stores 0.
  11. RULE && short-circuits: in i != 0 && 10 / i the right side never runs when i is 0 — that is the guard, not luck.
What I actually got wrong (and why)
  • 10 % 3 + 10 / 3 — I wrote 6.333, it is 4. I read / as real division and % as the quotient.
  • char c = 'A' + 1 — I wrote 1, it is 'B'.
  • for (i = 5; i > 0; --i) — I wrote 6 runs, it is 5.
  • cin >> a >> b on 3 4 — I wrote a = 4, b = 3; the order is left to right.
  • v[0] = 1 on an empty vector — I said it throws; it is undefined behaviour.
  • cout << 7.0 / 2 — I wrote 3, it is 3.5.
  • int x = 7/2; double y = x/2; — I expected 3.5, it is 1. Truncation happens twice, not once.
  • 1 / 2 * 2.0 — I expected 1, it is 0.
  • double d = 1 / 3 — I expected 0.333, it is 0.
Not yet drilled
  • Part B — reading code: functions that return vs write back, running totals built up in a loop. Nothing done on paper yet.
  • Part C — find the bug: the average-of-n loop (four separate faults) and the class whose deposit() happily accepts a negative amount.
  • Part D — writing programs: maxOf with the empty-vector guard, and Account with a withdraw rule. Not written yet.

Next: 卷 C part B (read the code, 30) → part C (find and fix, 30) → part D (write the programs, 30). Part A is done and only bought 10 marks — 60 of the 100 sit in C and D.

Practice questions

Generated from the deck of the course you pick above — one answer is right, the other three come from the same course.

My projects