Here are some practice problems for midterm #1.
It is likely to be tremendously useful to work through these problems, but as the first page warns, these may not be entirely representative of our exam. Indeed, we may not reach all the learning goals assessed in the practice problems by the exam; so, some of these may really be practice problems for midterm #2!
Let’s work some problems centering on pictures of Naomi. (The primary target of my image-capturing devices.)
Just for fun: UBC CS’s most cited paper (last I checked!), by David Lowe, looks at how to find similar features between images using the SIFT algorithm.
Our reading question was to determine for a particular interval in the following unweighted scheduling problem whether that interval would be considered by the textbook’s greedy algorithm before or after the interval labeled A. Which interval you needed to look at depended on your section and student #.
PDF document: Assignment #3 (corrected)
Due Monday 2015/02/02 at 5PM in our submission box (#32).
Just a brief handout playing with the importance of nodes in a graph.
We had reading questions as well. For both sections, the question was “In the given graph, write down the letter of each node (A, B, or C) in the same strong component as your number (2nd digit of student #).” The graphs were:
Optional, just for fun:
If you’d like to get ahead, we’ll be reading sections 4.3, 4.5, 4.6, and 4.7. Section 4.4 should be review of CPSC 221. Then, we’ll move on to Chapter 5.