HOME | EDUCATION | RESEARCH | PEOPLE | ABOUT US | SITE MAP  
 

DISCRETE MATHEMATICS I

MACM 101 (Fall, 2011) - Downtown Campus



Links:

  • Sections Covered for Final Examination

    (Inactive Link)


General Information


Instructor: Steven Pearce (TASC-1 9225, Burnaby Campus)
Phone: 778-782-4444
E-mail: stevenpATcs.sfu.ca - Emergencies Only

Office Hours:
  • One hour before class (room to be determined)
  •  TA LAB HOURS CAN BE FOUND AT SIMS.
Class e-mail: macm-101-e1@sfu.ca

Text: Discrete and Combinatorial Mathematics, by Grimaldi

Prerequisites/Corequisites: BC High School Math 12. A minimum grade of C is required in all prerequisite courses.

LATE POLICY: 25%/day

Note that you only have one week to review examinations and homework assignments after receipt.

Grading:

Homework (10%) - Roughly every two weeks (announced in class)
Midterm Examination #1 (25%) - Wednesday, October 12
Midterm Examination #2 (25%) -  Wednesday, November 16
Final Examination (40%)  - Friday, December 16, 2011 from 19:00 to 21:00hrs in HCC1700
You can keep track of your grades on our new grade-tracking webpage located at http://courses.cs.sfu.ca (to be dicussed).

Tentative Schedule of Lectures

Week 1

Administration and Introduction to course
Overview of Discrete Mathematics (class notes)
Introduction to Combinatorics (1.1-1.3)

Week 2

Cominatorics continued (1.3-1.4)
Inclusion/Exclusion Principle (8.1)

NOTES ON COMBINATORICS

Week 3

Propositional Logic (2.1)
The Laws of Logic (2.2)
Rules of Inference (2.3)

NOTES ON PROOFS

Week 4

Quantifiers and Methods of Formal Proofs (2.3-2.5 and my notes)

Week 5

MIDTERM #1 (50 minutes) 

Set Theory  (3.1-3.3).

Week 6

Mathematical Induction (4.1)
Recursion (4.2)


Week 7 

WE WILL NOT BE EXPLICITLY COVERING THESE SECTIONS (MY NOTES ONLY, PLEASE)
Number Theory (4.3-4.4; know enough for applying proof templates)

Week 8

Relations and Functions (5.1-5.3, 5.6) 
NOTE: INVERSE AND COMPOSITE FUNCTIONS FROM CLASS NOTES ONLY 

Week 9

Computational Complexity (5.7-5.8; mostly rely on my notes)

Week 10

MIDTERM #2
(50 minutes)
Computational Complexity continued

Week 11

Continued

Week 12

Graph Theory (Introduction from Chapter 11 and mostly from Chapter 12 - sections to be announced)

Week 13

Continued

Review



REVISED November, 2011