Day 11: mat385

Today:

• Exam coming up Monday!
  • I'll take one problem off the problem set for Section 2.5/2.6 problem set.

• Return Homework 2.4: graded
  • #18
    • Some of you worked this proof from both ends of P(k+1): I prefer moving from one side of P(k+1) to the other.
  • #28/30

• Review of old stuff:
  • Here are some old tests:
    • 2007 Fall Test 1 (2007 Fall Test 1 key) -- didn't do prolog in this class
    • 2006 Spring Test 1 (2006 Spring Test 1 key)
    • 2005 Spring Test 1 (2005 Spring Test 1 key)
    • 2003 Fall Test 1 (2003 Fall Test 1 key)
    • This was a one-hour exam (course took place 3 days per week): 2002 Fall Test 1 (2002 Fall Test 1 key)
    • 2002 Spring Test 1 (2002 Spring Test 1 key) Note: we did proof of correctness in this course; we didn't this time.
  • Overview of Chapters 1 and 2

  • Suggestions?

• Section 3.1 (pdf): Sets

• Section 3.1 worksheet (pdf): Sets

Links:

• "Note: any time you have a procedure whose complexity is less than O(n), it means intuitively that the procedure does not examine all of the input."
  Binary sort beats O(n) by having already examined the input, and having put it in order.
• A nice description of complexity with applications to sorting
• A great Venn diagram applet
• A nice Venn diagram applet (for the basic ideas). (From this source)