MA 240, Fall 2005, Instructor:  Jeffrey Horn

CLASS ANNOUNCEMENTS (Friday, December 2, 2005)

• General Announcements (for all students)
• What IS New:
  • Added HW 8 (see below).  Last homework!  Graphs.  Due last day of class!  I will hand out a solution on that day, so if you have ANY questions, get them answered Wednesday in class, or Thursday.  I will have office hours Thursday afternoon, 1:00-3:00pm, and later, 5:00-7:00pm.  I will be covering the rest of the material needed for HW8 in class on Monday!
• What Was New
  • Added HW 7 (see below). 
  • Added HW 6 (see below). Due date extended to Monday, Nov. 21. (just get it to me before you leave for break, if you don't want to lose credit!)
  • Added QUIZ 3: Sears Tower (see below).
  • Added QUIZ 2 (Binary Hypercubes). Only available in hardcopy in class or on my office door (1119 NSF).
  • Added QUIZ 1:  The Proof (see below).
  • Added HW 5 below.  (Nested Quantifiers)
  • Also, reminder to everyone that if you like our work on "digital Braitenberg vehicles" (HW 3), and/or if you like the use of 3D simulators for evolving behaviors, please come to this week's dept. colloquium by Correy Kowall.
  • Added HW 4 below. (Predicate Logic)
  • Added HW 3 below. (Digital Braitenberg Vehicles)
  • Added HW 2 below.  NOTE the new due date:  Friday, Sept. 23, 2005.
  • Class canceled Wed. Sept. 7, due to delayed return of instructor: HW1 due date extended to Monday, Sept. 12.
    Added HW 1 below.
  • Welcome to class!

   

CONTENTS:

• Administrativa
• Lecture Notes
• Homeworks
• Tests and Quizes

ADMINISTRATIVA

• Syllabus
• The textbook's web site

LECTURE NOTES

•  Week of August 29 (first week!)
  • Introduction, Syllabus, Policies (attendance, etc.)
  • Overview of course, topics
  • Readings:  Chapter 1, sections 1.1 and 1.2

HOMEWORKS
 

• HOMEWORK 1:    Propositional Logic
  • First read sections 1.1 and 1.2 of Rosen
  • From the text, Rosen, pp. 15 -20:
    • #6 (b,e,h), #24 (all), #42 (all).
  • Due on Monday, Sept. 12, 2005
  • Solution handed out in class on Wednesday, Sept. 14, 2005
• HOMEWORK 2:    Boolean Functions
  • Handed out: (in class) Wednesday, Sept. 14, 2005.
  • Due on:  Friday, Sept. 23, 2005
  • First read sections 10.1 and 10.2 of Rosen (you can skip the half page on "Duality" on page 706)
  • From the text, Rosen,
    • pp. 707-708:    #2 (all), #10 (all), #22 (all).
    • p. 712:  #12 (all)
• HOMEWORK 3:    Here
• HOMEWORK 4:    Predicate Calculus (2nd Order Logic or "Quantified Logic")
  • Handed out: (in class) Friday, October 7, 2005.
  • Due on:  Tuesday, Oct. 18, 2005
  • First read section 1.3 of Rosen.
  • From the text, Rosen,
    • pp. 40-43:    #6 (all), #10 (all), #34 (all), #54.
• HOMEWORK 5:    Nested Quantifiers, etc.
  • Handed out: (in class) Friday, October 7, 2005.
  • Due on:  Monday, Oct. 24, 2005
  • First read section 1.4 of Rosen.
  • From the text, Rosen,
    • pp. 51-54:    #4 (c,d), #10 ( a-f, i ), #30 (a,d).
• HOMEWORK 6:    Counting
  • Handed out: (in class) Friday, November 11, 2005.
  • Due on:  Monday, November 21, 2005
  • Read section 4.1 of Rosen.
  • From the text, Rosen,
    • pp. 310-312:   #8, #10, #12, #14, #16, #24, #36, #50.
• HOMEWORK 7:     Permutations and Combinations
  • Assigned:  Monday, Nov. 21, 2005
  • Due:  Friday, Dec. 2, 2005
    • Read section 4.3
    • From the Rosen text:
      • pp.  324-326:   #10. #18 (all), #34, #40.
      • pp.  333:   #4.
      • ALSO:
        • Look at question 33 on page 334 (answer is on page s-36)
        • Also, look at your class notes.
        • Then answer these questions about the following map:
    • 
    • Students going to the university from the subway stop are always in a hurry and so they will only go either east or south, never north or west.  Therefore, they will always have to travel five  blocks east and five blocks south, for a total of ten blocks, but in many possible combinations.  But never will students enter "DarkWood", which is a city park that has become populated by hideous and evil creatures (for some unknown reason).  Sarah, an NMU alumna, has started her own coffee house business, StarDoe, which she has located at the intersection marked by the green star above.  Assuming that students going from the subway stop to the university each morning are equally likely to take each of the possible paths (of those that do NOT go THROUGH DarkWood; they can skirt the edges, however), Sarah wants to know what percentage of those students will go through her intersection.
      1. How many shortest paths (8 blocks) exist? 
      2. At her current location (green star), how many of these shortest paths (of exactly eight blocks) go through her intersection?   
      3. Sarah has the possibility to relocate to either of the two white star locations above.  Which, if either, would give her more people traffic?

       

  HOMEWORK 8:    Graphs
  • Assigned:  Friday, Dec. 2, 2005
  • Due:  Friday, Dec. 9, 2005
    • The background you will need to complete this assignment will be covered in lectures, 11-30 through 12-5.  But you can also refer to the following sections:  Section 8.2, 8.3, 8.5, 9.1, and 9.3, for the following problems:
    • From the Rosen text:
      • p.  556:  #42.
      • p. 564:  #14, #16, #22.
      • pp. 588-589:  #2, #6, #10.
      • p. 643:  #8.
      • p. 673:  #16.  (do not write out any parentheses!)

   

TESTS AND QUIZES

• QUIZ 1:  The Proof (click here).  Take home.  Handed out Monday Oct. 24, 2005.  Due Friday, Oct. 27, 2005, in class (you can email me your answers).
• QUIZ 2:  Binary Hypercubes (available only as hardcopy in class or on my office door, 1119 NSF).
• QUIZ 3:  Sears Tower (click here)