CIS 275   —   FALL 2011

Introduction to Discrete Mathematics

News

• I've posted sample solutions for Exam 3.
  Posted: Mon Dec 12 16:00:49 EST 2011
  
  
• I've sent email (via Blackboard) regarding the grading scale for the course. If you haven't received it, you might want to check your spam filter.
  Posted: Mon Dec 12 15:30:56 EST 2011
  
  
• Exam 3 has been graded. You can pick yours up from the main EECS reception desk in CST 4-206 during regular business hours.
  Posted: Mon Dec 12 15:24:03 EST 2011
  
  
• Dan and I will be holding office hours throughout the week.

  My office hours are at the following times:

  Day	Time
  Monday, December 12	2-3:30pm
  Tuesday, December 12	11am-1pm
  Thursday, December 14	1-2:30pm

  Dan will be holding office hours on Wednesday from 2-4pm.
  Posted: Mon Dec 12 15:16:56 EST 2011
  
  

• Old news

Homeworks

• Assignment 1:   Due Thursday, 8 September
  
• Assignment 2:   Due Thursday, 15 September
• Assignment 3:   Due Thursday, 22 September
  To maximize your points, be sure to follow the course style guide.
• Assignment 4:   Due Thursday, 29 September
• Assignment 5:   Due Thursday, 20 October
• Assignment 6:   Due Thursday, 27 October
  For suggestions on how to show that a set is countable or uncountable, look here.
• Assignment 7:   Due Thursday, 10 November
• Assignment 8:   Due Thursday, 17 November
• Assignment 9:   Due Thursday, 1 December
• Assignment 10:   Due Tuesday, 6 December

Exams

• Exam 1: Thursday, October 6
• Exam 2: Thursday, November 3
• Exam 3: Thursday, December 8
• Final Exam: 8-10am, Friday, December 16

Pop Quizzes

• Quiz 1 from Sept 8, plus sample solutions
• Quiz 2 from Sept 22, plus sample solutions
• Quiz 3 from Sept 29, plus sample solutions
• Quiz 4 from Oct 25, plus sample solutions
• Quiz 5 from Nov 15, plus sample solutions
• Quiz 6 from Nov 29, plus sample solutions

Support

• Notes, code, and transcripts from lectures
  • Lecture 1 (30 Aug): Administrative stuff, plus prereq quiz (and sample answers)
  • Lecture 2 (1 Sept): Propositional logic
    • Slides available as slides or handouts
    • The formal-proof example from the very end of lecture
  • Lecture 3 (6 Sept): Predicate logic (part 1)---Predicates, quantifiers (∀ and ∃), duality of ∀ and ∃, common idioms
  • Lecture 4 (8 Sept): Predicate logic (part 2)
    • Topics: Nested quantifiers, domains and interpretations, logical equivalence, logical implication, instantiation and generalization
    • Slides (with the lecture-spotted typos corrected) available as slides or handouts (typos corrected)
  • Lecture 5 (13 Sept): Inference rules for predicate logic
    • Topics: Instantiation and generalization (again), formal proofs, mathematics vocabulary
    • Slides available as slides or handouts
      Note: We did not get to the "Mathematical Proofs" slides.
  • Lecture 6 (15 Sept): Mathematical proofs
    • Topics: Direct proofs, proofs by contraposition
    • For slides, see the last several slides from Lecture 5.
  • Lecture 7 (20 Sept): Proofs by contradiction
  • Lecture 8 (22 Sept): Introduction to sets
  • Lecture 9 (29 Sept): Proving properties about sets
  • Lecture 10 (4 Oct): Informal review of topics for Exam 1
  • Lecture 11 (11 Oct): Introduction to functions
  • Lecture 12 (13 Oct): More functions (and proving properties about functions)
  • Lecture 13 (18 Oct): More function proofs, plus introduction to countability
  • Lecture 14 (20 Oct): More on countability (and the uncountability of the set of real numbers)
  • Lecture 15 (25 Oct): Some countability examples, plus introduction to relations
  • Lecture 16 (27 Oct): More on relations
  • Lecture 17 (1 Nov): Impromptu review for Exam 2
  • Lecture 18 (8 Nov): Mathematical induction
  • Lecture 19 (10 Nov): Recap of a general approach for setting up proofs, plus more mathematical induction
  • Lecture 20 (15 Nov): Recursively defined sets
  • Lecture 21 (17 Nov): Structural induction
  • Lecture 22 (29 Nov): Structural induction, plus equivalence relations
  • Lecture 23 (1 Dec): Partial orders, posets, and assorted vocabulary
• Miscellaneous
  • Polya's How to Solve It
  • A reference list of equivalences and inference rules for propositional logic (contains those from text, plus a few other useful ones)
  • A reference list of equivalences and inference rules for predicate logic
  • An online reference for predicate-logic inference rules, from Shunichi Toida
  • Version 1.0 of the course style guide for proofs
• Recommended reading
  • Doing Honest Work in College, Second Edition by Charles Lipson, Univ. of Chicago Press, 2008.

Administrivia

• Course syllabus and Honor Policy
• Summary of administrative details, including:
  • Instructor info
  • TA info
  • When & where
  • Texts
  • Coursework (e.g., grades)
• Educational objectives and student learning outcomes for the Computer Science undergraduate program
• Educational objectives and student learning outcomes for the Computer Engineering undergraduate program

Important Dates

First lecture	Tues	30 August
Labor Day - No classes	Mon	5 September
The last day to add a course	Tues	6 September
The financial drop deadline	Mon	19 September
The academic drop deadline	Tues	25 October
The withdrawal deadline	Fri	18 November
Thanksgiving Break - No classes	Sun-Sun	20-27 November
The last day of classes	Fri	9 December
Final Exam (8am-10am)	Fri	16 December