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:
- We will be working through a worksheet on the stable marriage problem (SMP).
- We also have two extra handouts today on the Gale-Shapley algorithm and on how to solve a 320 problem.
See you in class!
UPDATE (July 3): here are the introductory slides and clicker questions from today’s class.