CSci 271 Syllabus

Course Objectives

Give a solid foundation in discrete mathematics.
Establish the relevance of discrete methods to computer science.
Ensure a fair and accurate measurement of student performance.

Course Text

The text book for this course is Discrete Mathematics and its Applications, by Kenneth Rosen. Additional materials will be available via the Web or handed out in class.

Students are expected to have read the assigned chapters before the indicated class session.

Schedule

Lectures and events will follow this weekly schedule:

Week  Monday                           Wednesday

0                                      Sep 2: 1.1 Logic

1     Sep 7: Labor Day Holiday         Sep 9: 1.2 Propositional Equivalences
                                              1.3 Predicates and Quantifiers

2     Sep 13: 1.4 Sets                 Sep 16: 1.5 Set Operations

3     Sep 21: 1.6 Functions            Sep 23: 1.7 Sequences and Summations
      
4     Sep 28: 1.8 The Growth of        Sep 30: 2.1 Algorithms
                  Functions                    2.2 Complexity of Algorithms

5     Oct 5: 2.3 Integers and          Oct 7: 2.6 Matrices
                 Division

6     Oct 12: 3.1 Methods of Proof     Oct 14: First Mid-term Exam
              3.2 Mathematical                 (ch 1-2)
                  Induction

7     Oct 19: 3.3 Recursive            Oct 21: 4.1 Basics of Counting
                  Definitions                  4.2 Pigeonhole Principle

8     Oct 26: 4.3 Permutations and     Oct 28: 4.4 Discrete Probability
                  Combinations
                  
9     Nov 2: 5.1 Recurrence            Nov 4: 5.4 Inclusion-Exclusion
                 Relations              

10    Nov 9: 6.1 Relations and         Nov 11: Second Mid-term Exam
                 Their Properties             (ch 3-5 in OHE 122)
             6.3 Representing
                 Relations

11    Nov 16: 6.5 Equivalence          Nov 18: 7.1 Introduction to Graphs
                  Relations

12    Nov 23: 7.2 Graph Terminology    Nov 25: 7.3 Representing Graphs and
                                                   Graph Isomorphism

13    Nov 31: 7.4 Connectivity         Dec 2: 7.5 Euler and Hamilton Paths

14    Dec 7: 8.1 Introduction to       Dec 9: Review
                 Trees

15    Dec 14: Final examination
              4:30 to 6:30 PM

Email Richard dot J dot Wagner at gmail dot com