Day 10: mat385

Today:

• Note: our first test (next week, Monday) will cover only material through 2.5.

  Here are some old tests (note: you'll see no Prolog, of course, in your test, since we didn't cover 1.5):

  • 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.

  My objective will be to find interesting questions that don't look exactly like any of the questions I asked in the previous exams, but that gets harder and harder with the passage of time!

• Return Homework 2.2: this person uses a little different strategy than I, but a good one. There's always more than one way to do a problem in mathematics!
  • #7
  • #27

• Hand in homework 2.4.

• Next time: hand in homework 2.5 (to be graded by Thursday)

• Section 2.5 (pdf): Analysis of Algorithms

• Problems from section 2.5 homework:
  • Suggestions?

• Section 3.1 (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)