Here's an updated version of the course information sheet (aka the syllabus) I handed out on the first day of class. It includes the grading scheme for the course. A few of you have asked about your current grades in the course. You've got your graded midterms and problem sets, as well as your participation grades (on OAK), so you can use the grading info here to compute your own grades.
Here are some problems worth practicing from the material we covered after the second midterm.
- Section 4.1 #5, 7, 23, 31, 33
- Section 4.3 #33
- Chapter 4 Supplementary Exercises #5
- Section 5.6 #1, 3, 5, 17
- Section 5.7 #3, 5
- Section 9.2 #1, 7, 15
Note that Section 9.2, as well as answers to the odd-numbered exercises in Section 9.2, are available on OAK.
Here's a great online article describing how to use the Markov chain approach we used to figuring out Monopoly to Google's PageRank algorithm. Had this been available two months ago, I would have required you to read it!
Here's the entire set of clicker questions (with solutions) for the semester. Practice problems for the new material coming soon!
You may take the final exam on either Monday, December 14th, from 12 to 2 or Friday, December 18th, from 3 to 5. Here's the review session schedule:
- Friday, December 11, 11-12:30, SC 1117
- Sunday, December 13, 6-7:30, SC 1206 (our usual classroom)
- Thursday, December 17, 6-7:30, SC 1206 (our usual classroom)
I won't have any formal office hours, but if you'd like to get some one-on-one help, just send me an email and we can make an appointment.
The final exam will be comprehensive, but the material covered since the second midterm will be slightly overrepresented. That would be Sections 5.5-5.7, linear programming, and the material from chapter 4 on abstract vector spaces (particularly the polynomial spaces Pn). In terms of problem sets, that's problem sets 8, 9, and 10. Here's the full, day-by-day schedule for the entire semester to help you remember what sections we covered.
Here's your last problem set. It's due at the start of class on Monday, December 8th.
Here today's clicker questions from Section 4.1, which will help you tackle our final problem set, to be posted today or tomorrow. Please note that I didn't get to my final clicker question today (on linearly independent functions), so I've included a complete solution to that question in this handout. You'll want to reference it as you work on the problem set.
Here are solutions to Midterm 2. I'll be handing back your corrections in class today.
Please read Section 4.1 and answer the following questions before class on Thursday, December 3rd.
- Consider the space S described in Example 3. Why might it be useful to know that this space, with addition and scalar multiplication as defined in Example 3, is a vector space?
- It turns out that in any vector space, the zero vector (from Axiom 4) is unique. That is, any vector space can have only one zero vector. Why isn't this fact included as one of the axioms in the definition of a vector space?
- Consider the set of all functions of the form p(x) = ax2, where a is any real number. Is this set a subspace of P3?
- What is one specific question you have on the reading?