Month: February 2017

Posted on

Handouts and Notes for 2017/03/01

We will start talking about Dynamic Programming today. We’ll kick things off with a worksheet on making change. The kind with coins, not the kind you want to see/be in the world.

  • For next time, please read Section 6.2. There’s no pre-reading quiz, but students reported dynamic programming was among the harder (and more important!) topics to learn last term. Reading now will help you understand!
  • Don’t forget this week’s tutorial quiz!
Posted on

Handouts and Notes for 2017/02/27

We’ll continue with our notes on divide-and-conquer (maybe even conquer them!) and perhaps do some live coding.

  • Here again is a sample solution to the d-and-c notes.
  • QuickSelect is an awesome and practical algorithm. It turns out, surprisingly, that we can also make a deterministic linear-time selection algorithm. If we get time, we may work through code for linear-time DeterministicSelect in class. (Here’s the Jupyter Notebook for that code.)
  • Before class next time, read Section 6.1 and complete the pre-reading quiz due Tue at 10PM.
  • There is a tutorial quiz this week (the week after mid-term break).
  • Don’t forget to read sections 5.3 and 5.4 plus the Master Theorem entry on Wikipedia. They’re not on the pre-class quiz, but they are tremendously important (and easy for us to assess!).
Posted on

Handouts and Notes for 2017/02/17

We’re continuing our divide-and-conquer notes today… and recovering from the midterm exam. (Phew!)

  • Here are the notes on divide-and-conquer we’re continuing today plus a sample solution to the d-and-c notes.
  • There will be a tutorial quiz the week you return from mid-term break.
  • Before the end of mid-term break, please read sections 5.3 and 5.4 plus the Master Theorem entry on Wikipedia.
  • We’ll release a pre-class quiz over mid-term break, but it will be due on the Tuesday after mid-term break (28 Feb), not at the end of mid-term break. This will include readings on 6.1; so get ahead and read it over break!
  • We (well, Steve) made a mistake on the readings for the latest pre-class quiz (the one due 9 Feb); so, everyone who submitted it will receive full credit. Oops! But, please be sure to understand the readings in Chapter 5/the Master Theorem, which are incredibly important and terribly fun to assess on exams 🙂
  • We’re almost done grading the midterm exams, but we’re working through some administrative issues with the group exams. So, it may be a couple of days before we can return them! We’ll keep you posted. We will return them to you on GradeScope and then get the grades moved over to Connect afterward.(Note: if your group and individual exam grading differs for a question even though the answers are near-identical, bear in mind that there are (at least) three possibilities. (1) They differed enough for us to feel they deserved different marks. (2) We made a mistake on the one with the higher grade. (3) We made a mistake on the one with the lower grade. Be sure to clearly understand what you wrote, what the solution is, and how it relates to the marking rubric. The rubric will be visible on GradeScope. Please feel free to discuss where answers were correct and where there were problem (though not explicitly grading/re-grading) with us in office hours. We won’t count mid-term break against the timeline for submitting regrade requests!)
Posted on

Handouts and Notes for 2017/02/15

In class, we’ll be continuing our current set of notes (on divide-and-conquer algorithms). The really exciting news, however is the midterm exam! Be sure to (1) have your GradeScope student # to fill out on the exam (worth a mark on the exam!) with you for the exam and (2) read the important midterm info post on Piazza.

For Friday’s class, please read section 5.2 in the textbook.

No pre-class quiz for Friday, but we’ll have one due before the Monday returning from midterm break.

Spam prevention powered by Akismet