Day 14: mat385

Last time

Next time

Today:

• Announcements:
  • Section 3.2 homework; graded 6, 24, 41

    General comments:

    • #6: You were expected to do an induction (or else use the formula for the closed form of a linear, first order recurrence relation).

    • #24: You were to find the recurrence relation -- some of you found it by leaning over and picking one up!

      You have to show how you came to the recurrence relation. Then, once you see that it's just the sum of the first $n$ integers, away you go.

    • #41: This way of thinking about Fibonacci numbers is really pretty interesting: the number of binary strings of length $n$ with no two zeros in a row is $F(n+2)$...

      But you were expected to figure out how to write a recurrence relation that computes that -- not just write one down, as if by magic! There's that "then a miracle occurred" again...:)

  • Section 3.3 homework: I'll get it graded soon, certainly before the exam.

  • If you'd like certain problems covered as part of a review, just let me know, and I'll cover those for Friday.

  • Exam 2 is coming up, covering sections 2.2, 3.1-3.3.

    Exam 2 will operate about like the prior exam. You'll be allowed a one-page sheet of notes you can use.

  • Previous Exam 1s and 2s from other years (these may cover more or less material -- and typically we had more time -- 75 minutes):?

    1. Here are some first exams from years past.
    2. Here are some second exams from years past. (Lots of this material we haven't covered yet!)

  • The two Section 4.1 assignments will be combined into one, which will be due the Tuesday after the exam.

  • You also have a project proposal due tomorrow. This is a one page description of the project.

    This is a proposal: I'll get back to you on any concerns. It should be typed. I want to know that the project will be

    • interesting to you (and nice if it's of interest to others, as well!);
    • not overwhelming;
    • doable within the time frame (projects are due April 23).
    See the Project page. Remember that I encourage double-dipping: if you're doing a project in another course that can be piggy-backed with this one, all the better.

• Today: we'll hit section Section 6.1: Graphs and Their Representations
  • Just FYI: this is usually the point at which computer scientists breathe a big sigh of relief!:) We start into more familiar territory.

  • Graph Definitions and Examples,
  • Isomorphic and Planar Graphs, and
  • Graph Representations
  • The marked up pdf for Section 6.1.

• Links:
  • Nothing new to report.