teaching machines

CS 245 Final

See the PDF.

CS 245 Lecture 28 – Heap Demo and Closeout

Agenda what ?s removing from a heap heap demo data structure decision tree advice Code BiggerOrBetter.java Heap.java Circle.java Circles.java Advice Rob Pike, in Notes on Programming in C: Fancy algorithms are slow when n is small, and n is usually small. Donald Knuth, in Structured Programming with Goto Statements: Programmers waste enormous amounts of time thinking about, or worrying […]

CS 491 Lecture 26 – Geocoding and Location-aware Apps

This is the final week of the semester, and you are hastily completing your projects. I’m occupied too, so this last exercise will be terse. The only feature we haven’t discussed in class is supporting reverse geocoded checkin posts. If someone goes to a business or other physical landmark, they should be able to—with one […]

CS 245 Lecture 27 – Heap Implementation

Agenda what ?s data structure utility belt what does this do? implementing a heap using an ArrayList size isEmpty clear finding children of a parent and parent of a child add remove What Does This Do? Code Heap.java Haiku

CS 245 Lecture 26 – Heaps and Priority Queues

Agenda what ?s interview questions program this design this heaps TODO Read section 6.5 in the data structures book. 1/4 sheet. Program This Design This Code … Haiku

CS 245 Lab 13 – Binary Search Trees

First, if you have checkpoints left over from last lab, get them inspected during the second 15 minutes of this lab. Don’t forget to work in pairs! Where possible, please work with someone that you did not work with last week. The exchange of new ideas and perspectives is not an opportunity you want to […]

CS 491 Lecture 25 – Localizable Text

Exercise Not separating model from view in our software makes our model not reusable for other applications. We have tight coupling between our logic and our presentation. Even within our view, however, we can have tight coupling. If we hardcode our American English into labels and currency and date formatting, we make our view not […]

CS 245 Lecture 25 – Binary Search Tree Add, Traverse

Agenda what ?s schedule homework (* this week, 1 next week, 1 during finals) last lab tomorrow final: Friday at 1 PM hw3 demo adding nodes to a BST iterating through a BST deleting nodes from a BST Code KeyValueVisitor.java BinarySearchTree.java Haiku

CS 491 Lecture 24 – OAuth2 Access Tokens

Agenda what ?s final exam time: R 5-7 exercise: getting OAuth2 access tokens Exercise Last time we started integrating access to a Picasa Web account into our mobile apps. All the interaction with the Picasa Web hinged on having a special string—the access token—which we sent along with every request in the Authorization header. We […]

1 2 3 7