week-12.json
json Container
READ_ONLY_ACCESS
[ { "id": "maths1-w12-000", "front": "Equivalence Relation vs Partial Order distinction", "back": "Equivalence is Symmetric; Partial Order is Antisymmetric" }, { "id": "maths1-w12-001", "front": "Vertex of parabola vs Critical point of derivative", "back": "Vertex $x = -b/(2a)$ is where $f'(x) = 2ax + b = 0$" }, { "id": "maths1-w12-002", "front": "Shortest path algorithm decision: Unweighted graph", "back": "Breadth-First Search (BFS) in $O(|V| + |E|)$" }, { "id": "maths1-w12-003", "front": "Shortest path algorithm decision: Nonnegative weights", "back": "Dijkstra's Algorithm in $O((|V| + |E|)\\log |V|)$" }, { "id": "maths1-w12-004", "front": "Shortest path algorithm decision: General weights (negative edges allowed)", "back": "Bellman–Ford Algorithm in $O(|V| \\cdot |E|)$" }, { "id": "maths1-w12-005", "front": "Fundamental theorem linking derivatives and integrals", "back": "Fundamental Theorem of Calculus (FTC): accumulation vs rate of change" } ]
Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.