-
Well, it's the end of the term. Have a great summer!
CS 173 (Spring 2021) Farewell
From Margaret Fleck
346 plays 1 -
Fun applications of uncountability: uncomputability, aperiodic tilings, quasicrystals
CS 173 (Spring 2021) Countability 4
From Margaret Fleck
1,519 plays 0 -
Uncountable sets, including two proofs by diagonalization
CS 173 (Spring 2021) Countability 3
From Margaret Fleck
1,922 plays 0 -
More examples of countable sets
CS 173 (Spring 2021) Countability 2
From Margaret Fleck
2,178 plays 0 -
Conway's Game of Life, a state diagram with infinitely many states.
CS 173 (Spring 2021) State Diagrams 3
From Margaret Fleck
1,952 plays 0 -
Measuring the size of sets using bijections and one-to-one functions
CS 173 (Spring 2021) Countability 1
From Margaret Fleck
2,525 plays 0 -
Phone lattices
CS 173 (Spring 2021) State Diagrams 2
From Margaret Fleck
2,128 plays 0 -
A simple state diagram example (the jug puzzle)
CS 173 (Spring 2021) State Diagrams 1
From Margaret Fleck
2,398 plays 0 -
Proof of a graph theorem using contradiction
CS 173 (Spring 2021) Contradiction 2
From Margaret Fleck
1,719 plays 0 -
Proof by contradiction: the basics
CS 173 (Spring 2021) Contradiction 1
From Margaret Fleck
2,078 plays 0 -
Partitions
CS 173 (Spring 2021) Collections of sets 3
From Margaret Fleck
2,289 plays 0 -
Counting subsets (no repetition) and assortments (like subsets but with repetition)
CS 173 (Spring 2021) Collections of Sets 2
From Margaret Fleck
2,344 plays 0 -
Sets that contain other sets (Emerald City Bakery), including the power set and how to use the power set in writing function signatures.
CS 173 (Spring 2021) Collections of sets 1
From Margaret Fleck
2,609 plays 0 -
NP
CS 173 (Spring 2021) Algorithms 5
From Margaret Fleck
2,126 plays 0 -
Karatsuba's algorithm
CS 173 (Spring 2021) Algorithms 4
From Margaret Fleck
3,434 plays 0 -
Building a recursive running time function from a fragment of code
CS 173 (Spring 2021) Algorithms 3
From Margaret Fleck
3,442 plays 0 -
Proving a primitive function relationship
CS 173 (Spring 2021) Algorithms 2
From Margaret Fleck
3,136 plays 1 -
Asymptotic complexity (big-O and its friends)
CS 173 (Spring 2021) Algorithms 1
From Margaret Fleck
3,871 plays 0 -
Grammar trees and induction on grammar trees
CS 173 (Spring 2021) Trees 3
From Margaret Fleck
2,568 plays 0 -
Using induction to prove a claim about trees.
CS 173 (Spring 2021) Trees 2
From Margaret Fleck
2,716 plays 0 -
Using a recursion tree to find a closed form.
CS 173 (Spring 2021) Trees 1
From Margaret Fleck
4,505 plays 0 -
Another example of unrolling a recursive definition.
CS 173 (Spring 2021) Recursive Definition 3
From Margaret Fleck
2,296 plays 0 -
Another example of inductive proof on a recursive definition. This time the definition uses two earlier values of the function.
CS 173 (Spring 2021) Recursive Definition 2
From Margaret Fleck
2,377 plays 0 -
Unrolling and recursive definition using a hypercube example
CS 173 (Spring 2021) Recursive Definition 1
From Margaret Fleck
3,520 plays 0 -
Using induction to prove a claim about the game Nim
CS 173 (Spring 2021) Induction 4
From Margaret Fleck
2,171 plays 0 -
Using induction to prove a claim about triominos
CS 173 (Spring 2021) Induction 3
From Margaret Fleck
2,323 plays 1 -
Why is induction a valid technique?
CS 173 (Spring 2021) Induction 2
From Margaret Fleck
2,668 plays 0 -
Introduction to induction proofs, using a simple summation example
CS 173 (Spring 2021) -Induction 1
From Margaret Fleck
3,541 plays 0 -
Two-way bounding, including graph coloring
CS 173 (Spring 2021) Bounding
From Margaret Fleck
2,993 plays 0 -
Counting isomorphisms
CS 173 (Spring 2021) Graphs 2
From Margaret Fleck
3,023 plays 0
Search for ""