MCS-236 Reading Assignments

Date: Sections: Topic:
 Feb. 8  Preface, 0.1  Compound Statements
 Feb. 10  0.2, 0.3  Negation, Quantifiers, Methods of Proof
 Feb. 11  1.1, 1.2  Sets, Operations on Sets
 Feb. 14  1.2  Proving things about Sets
 Feb. 15  1.3  Binary Relations
 Feb. 17  1.4  Equivalence Relations 
 Feb. 18    Cont.
 Feb. 21  1.5  Partial Orders 
 Feb. 22    Cont.
 Feb. 24  2.1  Functions, One-to-One, Onto
 Feb. 25  2.2  Inverses and Composition 
 Feb. 28  3.1  Division Algorithm
 Feb. 29  3.2  Divisibility and the Euclidean Algorithm
 Mar. 2    Cont.
 Mar. 3  3.3  Prime Numbers
 Mar. 6    Cont. 
 Mar. 7  3.4  Congruence
 Mar. 9  3.4  Cont.
 Mar. 10  3.5  Applications of  Congruence
 Mar. 13    Cryptography, Catch up
                   Test #1, Mar. 14
 Mar. 16  4.1   Mathematical Induction
 Mar. 17   Cont.
 Mar. 20   4.2  Recursively Defined Sequences
 Mar. 21  4.2   Cont. 
 Mar. 23  5.1   The Principle of Inclusion-Exclusion
 Mar. 24  5.2  The Addition and Multiplication Rules
                  Spring Break
 Apr. 3  5.3  The Pigeon-hole Principle
 Apr. 4   6.1  Permutations
 Apr. 6   6.2  Combinations
 Apr. 7  6.3  Repetitions
 Apr. 10   8.1, 8.2  Graphs:  an introduction, Definitions and Basic Properties
 Apr. 11   8.2  Cont.
 Apr. 13  8.3   Isomorphism 
 Apr. 14  8.3/9.1  Eulerian Circuits 
 Apr. 17  9.1  Cont.
                    Test #2, Apr. 18 
 Apr. 20  9.2  Hamiltonian Cycles
 Apr. 21   No class  
 Apr. 24  No class   
 Apr. 25  9.2   Cont.
 Apr. 27  10.2  Digraphs
 Apr. 28  10.4  Tournaments
 May 1  11.1  What is a tree?
 May 2  11.2  Properties of Trees
 May 4  11.2  Cont.
 May 5  11.3  Spanning Trees
 May 8  11.4  Minimum Spanning Tree Alorithms
 May 9  11.4  Cont.
 May 11  13.1  Planar Graphs
 May 12  13.1  Cont.
 May 15  13.2  Coloring Graphs
 May 16  13.2  Cont.
                    Test #3, May 23

Return to MCS236 Home

Last Modified:  5/13/00 16:29