In Class
What we work through together in class, so you can read it off your own screen instead of the board. Nothing here is handed in, and none of it is graded as class work. Some of it overlaps with the assignment that is open — that is deliberate, and it means the work is already done when you get there.
One page per class, newest first. During class, open the one at the top of this list and keep it open — it is the spec for whatever we are doing, and it is there so you can re-read a step instead of asking me to repeat it.
| Title | Description |
|---|---|
| Class 23 — Monday, November 16 | Quiz 10, then a transaction: two statements that land together or not at all, two transfers that wait for each other inside the database, and a server whose accounts survive a restart. |
| Class 22 — Wednesday, November 11 | A bank that outlives its program: a database, its tables and rows, and SQL sent to it from Java. |
| Class 21 — Monday, November 9 | Quiz 9, then a thread for each client, four robots and one lock, what one client keeps and what all of them share, and a server’s answers tested with no network. |
| Class 20 — Wednesday, November 4 | Two programs that talk to each other: a server and a client, one client at a time, then a thread for each client, and what the clients share. |
| Class 19 — Monday, November 2 | Quiz 8, then what a lock protects: a check and the action after it, which object’s lock a method takes, and five philosophers who stop for ever. |
| Class 18 — Wednesday, October 28 | How big a piece of work each thread should take; then two transfers that wait for each other forever, and the order that stops it. |
| Class 17 — Monday, October 26 | Quiz 7, then Wednesday’s count put right, with a test. Then work handed out to whichever thread asks, one number at a time. |
| Class 16 — Wednesday, October 21 | Monday’s Matrix, finished in your seat. Then two threads at once: one count they both add to, why it comes out short, and synchronized. |
| Class 15 — Monday, October 19 | What the compiler checks and what it cannot: a chain of integers is not a chain of numbers, a method with a type of its own, a bound. Then a Matrix for any number, in your seat. |
| Class 14 — Wednesday, October 14 | One chain for every type: generics, with the compiler on your side. Then a test is a method, run from an arrow. |
| Class 12 — Monday, October 5 | What searching everything costs, measured. Then the collections that do not search at all: a stack, a queue and a priority queue. |
| Class 11 — Wednesday, September 30 | A map that is holding a key and cannot find it, and the same move in a list and a tree set. Then the hash set, built by hand. |
| Class 10 — Monday, September 28 | Three sets that disagree about what they were given. Then a map that counts, a crash inside it, and two texts compared with three lines. |
| Class 9 — Wednesday, September 23 | An array that cannot grow, and the collection that can. Then two ways a list says no, and one way it says yes when it should not. |
| Class 8 — Monday, September 21 | Two collections holding the same two objects, disagreeing about how many they hold. Then the one change that settles it. |
| Class 7 — Wednesday, September 16 | A sort that compiles, starts, prints a line, and then dies. Then the one method that fixes it. |
| Class 6 — Monday, September 14 | A set that cannot find what it is holding. Then the one mistake the compiler refuses to let you make. |
| Class 5 — Wednesday, September 9 |
A reference is an address. Two bugs come out of that — equals that answers no, and a constructor that hands your object away.
|
| Class 4 — Wednesday, September 2 |
Invariants, and Fraction becomes a Number — the zero guard, final, and both of you push.
|
No matching items