CPSC 320 2019S2

Today we’ll spend a bit of time reviewing our proof of correctness from last time. Afterwards, we’ll start on our divide and conquer unit with this worksheet on QuickSelect.

Announcements for today:

• You have a tutorial quiz today.
• Assignment 3 will be released after tutorials, as usual, but unusually, this assignment is only for practice (because the normal deadline would have been the night before the midterm exam, which didn’t strike us as desirable). We strongly recommend you work through it as part of your exam preparation and put as much effort into it as you would an actual assignment.
• Assignment 1 grades have been released on Gradescope. If you wish to submit a regrade request, please read our policy on regrade requests first. (In particular: read the sample solution before you dispute your grade!)
• Your reading quiz on divide and conquer is due Thursday night. (Yes, this is after we will have started on the unit in class; the alternative was having a reading quiz and assignment due at the same time!)

Here are today’s clicker questions and the slides reviewing the proof of correctness of our greedy clustering algorithm.

In today’s class we’ll wrap up our worksheet on clustering and then we’ll prove that the algorithm we developed is optimal.

Announcements for today:

• Assignment 2 is due tomorrow night.
• We have some information about the midterm exam posted on Piazza.

Here are today’s clicker questions.

In today’s class we’ll start on greedy algorithms. In our worksheet we’ll develop an algorithm for clustering photos.

Announcements for today:

• Assignment 2 has been released and is due on Tuesday.
• Tutorials today will cover how to write good pseudocode and a review of asymptotic analysis notation (big- and little-O/omega, etc.). A reminder to please attend your registered tutorial section if possible, as the earlier sections are nearly full and priority needs to be given to students registered in that section.
• The second reading quiz on greedy algorithms is due on Sunday night. 

Here are the clicker questions from today’s class.

In today’s class we will play with graphs.

Announcements for today:

• The solution to Assignment 1 has been released on the course page. You will need a password to access it, which you can find on Piazza.
• You have a quiz in tutorial today, so be sure to attend your registered tutorial section. Assignment 2 will be released today at 4:30 pm and be due on Tuesday July 16 at 11 pm.
• The first reading quiz on greedy algorithms is due Thursday evening.

Here are the clicker questions from today’s class.

Today we’ll start on our asymptotic analysis worksheet. We also have this handy-dandy handout on formal definitions in asymptotic notation. If we have time, we may also get started on graphs.

Notes/announcements for today:

• Assignment 1 is due tomorrow night. Make sure you know how to log in and upload to Gradescope! You will have received an email invitation to your @ugrad.cs.ubc.ca email. If you can’t find the email, go to Gradescope and try to login as [your CSID]@ugrad.cs.ubc.ca and select “Forgot password?” to get a password reset link emailed you.
• Today is the add/drop deadline. This is your last day to switch tutorial sections or to drop the course without a W standing.

Here are the clicker questions from today’s class.

Today we’ll be working on the Resident Hospital Problem, which involves figuring out how to assign residents to different hospitals. Hopefully the problem will seem somewhat familiar to you…

Notes/announcements for today:

• Assignment 1 has been released and is due on Tuesday. Be sure to check out the Piazza post on administrative rubric items so that you don’t accidentally lose points for something like a hard-to-read scan.
• An invitation to the course Gradescope page has been sent to your @ugrad.cs.ubc.ca email address. We suggest you log in to Gradescope and submit something for Assignment 1 in advance of the deadline (you can resubmit as many times as you want before the deadline) to avoid any last-minute stress when you submit your assignment.
• Remember to complete your Canvas reading quizzes. In the upcoming week you have quizzes on asymptotic analysis and graphs due on Sunday, and a quiz on greedy algorithms due Thursday.
• You have tutorials this afternoon. There is no quiz in tutorial today. Instead, your TAs will go over mathematical proof techniques and some combinatorics review.

Here are the clicker questions from today’s class.