Graphs, Part I | Stanford CS103 Lecture 9
This lecture moves from the formal definitions of graphs and digraphs to independent sets, vertex covers, and their complement relationship.
learning
345 postsWalks, Graph Complements, and the Pigeonhole Principle | Stanford CS103 Lecture 10
Starting with walks, paths, cycles, and components, this lecture proves that a graph or its complement is connected and develops the pigeonhole principle through degrees and monochromatic triangles.
Generalized Pigeonhole, Ramsey Theory, and Average Load | Stanford CS103 Lecture 11
Use the generalized pigeonhole principle to force a monochromatic triangle at a six-person party, then solve a movie-preference puzzle through average load and contradiction.
Induction, Counterfeit Coins, and Invariants | Stanford CS103 Lecture 12
Induction is not a list of checked examples: establish a true starting point, prove that an arbitrary true case transmits truth to the next case, and invoke the induction principle.
Mathematical Induction, Part II | Stanford CS103 Lecture 13
This lecture connects starting from ordinary induction to induction may start later, following the official examples and proof obligations.
Finite Automata, Part I | Stanford CS103 Lecture 14
This lecture connects why begin with a weak computer to from device behavior to a state machine, following the official examples and proof obligations.
Finite Automata, Part II | Stanford CS103 Lecture 15
This lecture connects the dfa definition connects the first half of cs103 to regular means that some dfa exists, following the official examples and proof obligations.
Finite Automata, Part III | Stanford CS103 Lecture 16
This lecture connects the automata ladder measures power with languages to dfa transition tables, following the official examples and proof obligations.
Regular Expressions | Stanford CS103 Lecture 17
This lecture connects from closure properties to a language syntax to regex is mathematics, not one library, following the official examples and proof obligations.
Nonregular Languages | Stanford CS103 Lecture 18
This lecture connects four equivalent descriptions of regularity to the precise finite-memory intuition, following the official examples and proof obligations.
Context-Free Languages | Stanford CS103 Lecture 19
This lecture connects from finite-state limits to recursion to the arithmetic grammar, following the official examples and proof obligations.
Turing Machines, Part I | Stanford CS103 Lecture 20
This lecture connects why the model changes after cfgs to long addition and local access, following the official examples and proof obligations.
Turing Machines, Part II | Stanford CS103 Lecture 21
This lecture connects the sample tm looks back from the end to beyond pairwise marking, following the official examples and proof obligations.
Turing Machines, Part III | Stanford CS103 Lecture 22
This lecture connects a quick quantifier audit for recognizers and deciders to why every decision problem can be represented as a language, following the official examples and proof obligations.
Unsolvable Problems, Part I | Stanford CS103 Lecture 23
This lecture connects returning from r, re, and utm to three self-reference warm-ups, following the official examples and proof obligations.
Unsolvable Problems, Part II | Stanford CS103 Lecture 24
This lecture connects defining and locating halt to why halt is recognizable, following the official examples and proof obligations.
Unsolvable Problems, Part III | Stanford CS103 Lecture 25
This lecture connects the lava diagram's two classification tasks to the deck's operational reading of rice's theorem, following the official examples and proof obligations.
Complexity Theory | Stanford CS103 Lecture 26
This lecture connects decidable does not mean feasible to efficiency requires choosing a resource, following the official examples and proof obligations.
Wrap-Up: Four Foundations and Where to Go Next | Stanford CS103 Course Overview
The final deck reconnects proofs, graphs, automata, and computability, then maps those foundations to Stanford courses that use them.
Reading x86-64 Addressing Modes Without Confusing Addresses and Values | Stanford CS107 Lecture 15
CS107 Lecture 15 decomposes x86-64 mov operands into immediate, register, absolute, indirect, displacement, indexed, and scaled-indexed forms, then unifies pointer dereference and array access with D + R[b] + R[i]×s.