Readings for 2018/04/01

Before Sunday’s pre-class quiz: Read section 8.3; theorems 8.12, 8.14 and the subsection called “General Strategy for Proving New Problems NP-Complete” from section 8.4; one of sections 8.5, 8.7, and 8.8; and again read through 8.10 to tie these together.

 

Readings for 2018/03/24

Before Sunday’s pre-class quiz: Read sections 6.6 and 8.1 in your textbook. Note that as you read Chapter 8, you will want to visit and revisit 8.10 to get a high-level sense of how NP-complete problems fit into the set of problems you’re learning!

Readings for 2018/02/04

Before Sunday’s pre-class quiz: Read sections 4.2 or 4.3 (your choice, though many of you may have already read 4.2!) and section 4.4. If you decide to read section 4.3, you may want to also look at this document that provides examples illustrating the five cases in the proof of Theorem 4.12.

Readings for 2018/01/28

Before Sunday’s pre-class quiz: Read sections 3.5, 3.6, 4.1, and 4.2. This will start you in on greedy algorithms. Note that we’ll start working (in the week after this pre-class quiz) on greedy algorithms via a graph example, bridging the graphs and greedy algorithms sections.

Readings for 2018/01/21

Before Sunday’s pre-class quiz (pquiz): Our upcoming readings for the week of Jan 15 to Jan 21 are: Sections 3.1, 3.2, 3.3, and 3.4. Sections 3.1-3.3 should be largely review, with section 3.4 providing a (hopefully!) new application area to explore.

(Readings will slow down after this week, as we exit “review territory” in the textbook.)

Readings for 2018/01/08 and the first pre-readingquiz

Please finish Chapter 1 and watch and work through the Unequal Stable Marriage Problem video playlist.  Here is a blank copy of the problem. (Suggestion: print the blank problem and try it, but after each major section or if you’re stuck even briefly, let the screencast help! This is not the way to study for an exam, but it will prepare you for class.)

This week and always, the pre-reading quiz also lists the readings it assesses in its description. So, if you’re ever in doubt, just check the quiz! (If we mess up and post different readings, just tell us on Piazza! 🙂

First Day Notes

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 today, much longer than our usual since it’s the start of the term:

  • Sign up for our Piazza discussion board at https://piazza.com/ubc.ca/winterterm22017/cpsc320/ and read the welcome post there that has other important material! You’ll need the Piazza access code, which we’ll announce each day in lecture for the first week or so.
  • Get your @ugrad.cs.ubc.ca account set up. See https://www.cs.ubc.ca/getacct/.
  • Come to your registered tutorial this week (3-5 Jan) for some review problems to help get you ready for CPSC 320. Next week (10-12 Jan) there will be a graded quiz focused on stable marriage and algorithm/data structures design and analysis review in tutorial!
  • Do the pre-class reading for 2018/01/05, which is Kleinberg and Tardos Section 1.1. (Do get the textbook ASAP or be prepared to thoroughly study other resources on your own! Previous terms’ students have suggested that the international edition is equivalent but cheaper, although we cannot guarantee that’s true!)
  • Review CPSC 221/EECE 320, especially asymptotic analysis and very high-level data structure info (binary trees, self-balancing binary trees, heaps, hash tables, etc.).

Next, here are today’s handouts:

 

Finally, if you wish to read ahead, we expect to read at least these sections in this order (changes may happen but probably not drastic ones):

  • The rest of Chapter 1 (and, for every chapter we read, the chapter intro)
  • Chapter 2 (largely review), with emphasis on 2.3
  • Chapter 3
  • Sections 4.1-4.7 of Chapter 4 (a bit of which is likely review)
  • Sections 5.1-5.4 of Chapter 5, plus the Master Theorem on Wikipedia
  • Sections 6.1-6.6 and 6.8 (which is likely review) of Chapter 6
  • Sections 8.1-8.5, maybe 8.6, 8.7, 8.8, and 8.10 of Chapter 8. Note that 8.10 is useful to read early and reread as you work through this chapter.

Spam prevention powered by Akismet