Monthly Archives: July 2019

July 5 Handouts and Notes

Posted on July 4, 2019 | Leave a comment

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.

Leave a comment

Posted in Handouts

Assignment #1

Posted on July 3, 2019 | Leave a comment

Here is Assignment #1, due 11 pm on July 9.

After Wednesday’s class, you should be able to do questions 1 and 2, along with the first parts of questions 3 and 4. You should be able to do the parts of questions 3 and 4 that deal with reductions after Friday’s class (though we will post Friday’s lecture materials sometime on Thursday, so you can look ahead in that worksheet if you want to read about reductions early and get a head start).

Leave a comment

Posted in Assignments

July 3 Handouts and Notes

Posted on July 2, 2019 | Leave a comment

Welcome to CPSC 320!

Our overall course goal is to learn about a common and important set of problem types, algorithmic solution approaches, and analysis techniques, and to gain the tools and experience necessary to judge how a new problem might fit one of these categories, how to approach solving the problem, and how to analyze and adjust your solution.

A few administrative notes for tomorrow’s class, longer than usual since it’s the start of the term:

  • Sign up for our Piazza discussion board at http://piazza.com/ubc.ca/summer2019/cpsc320. You’ll need the access code, which was emailed to you last week (unless you joined the waitlist later than Friday), is on the Canvas landing page, and will be announced tomorrow in class.
  • Come to your registered tutorial tomorrow. There will be a graded quiz focused on asymptotic analysis and data structures.
  • Complete the reading quizzes due this week on Canvas. There are quizzes on the stable matching problem and the course syllabus due Thursday night, and on asymptotic analysis and graphs due Sunday night. (Future weeks will probably not have multiple reading quizzes due on the same day: this was unfortunately necessary for scheduling purposes as we cover several different units early in the term.)
  • Make sure you have run getacct and have your CS ID. You will need to activate your CWL at https://www.cs.ubc.ca/getacct/ to access our Canvas page.
  • Bring your iClicker to tomorrow’s class, or set up your phone/laptop to answer iClicker questions. If you are using your phone or laptop, our course code is CPSC 320, the title is Intermediate Algorithm Design and Analysis, and the term is 2019S2.

Meanwhile, here are the handouts for tomorrow’s class:

See you in class!
UPDATE (July 3): here are the introductory slides and clicker questions from today’s class.

Leave a comment

Posted in Handouts, Logistics