Course Schedule, Discrete Structures, Fall 2007

(This schedule is tentative and may change slightly as the course progresses.)
Day Date Topic(s) Section of Book (Homework Problems)
Wed Sep 5 Introduction
Sets and Subsets
Operations on Sets

1.1 (HW: # 1, 3, 7-19 odd, 23, 27)
1.2 (HW: # 1-19 odd)
MON Sep 10 Sequences
Division in the Integers
LAST DAY TO DROP A CLASS
WITHOUT RECEIVING A "W"
1.3 (HW: # 1-21 odd, 39)
1.4 (HW: # 1-21 odd, 39, 41)


TUE Sep 11 LAST DAY TO ADD A CLASS
Wed Sep 12 The Euclidean Algorithm
Matrices
Quiz 1
1.4
1.5 (HW: # 1-13 odd, 31, 33)
1.1 - 1.4
Mon Sep 17 Matrices
Mathematical Structures
1.5
1.6 (HW: # 1-23 odd)
Wed Sep 19 Truth Tables
Implication
Mathematical Induction
Quiz 2
2.1 (HW: # 7, 9, 23-31 odd)
2.2 (HW: # 11, 17)
2.4 (HW: # 1-13 odd, 17, 21, 23, 27)
1.5, 1.6
Mon Sep 24 Mathematical Induction
Permutations
2.4
3.1 (HW: # 1-5 odd, 9-15 odd)
Wed Sep 26 Combinations
Elements of Probabability
Quiz 3
3.2 (HW: # 1-15 odd)
3.4 (HW: # 7-15 odd, 31-35 odd)
2.1, 2.2, 2.4, 3.1
Mon Oct 1 Recurrence Relations
Product Sets
3.5 (HW: # 1-17 odd)
4.1 (HW: # 1-17 odd)
Wed Oct 3 Relations and Digraphs
Paths in Relations and Digraphs
4.2 (HW: # 1-25 odd)
4.3 (HW: # 1-19 odd, 27)
MON Oct 8 EXAM 1 On the material
covered to date
Wed Oct 10 Properties of Relations
Partitions
Equivalence Relations
4.4 (HW: # 1-25 odd)
4.1 (HW: # 23, 29)
4.5 (HW: # 1-13 odd)
Mon Oct 15 Computer Representations of Relations and Digraphs
Operations on Relations
Quiz 4
4.6 (HW: # 5-9 odd)
4.7 (HW: # 1-23 odd)
4.4 - 4.5
Wed Oct 17 Transitive Closure and Warshall's Algorithm
Functions
4.8 (HW: # 1-15 odd)
5.1 (HW: # 1-17 odd)
Mon Oct 22 Functions for Computer Science
Growth of Functions
Quiz 5
5.2 (HW: # 1-11 odd)
5.3 (HW: # 1-21 odd)
4.6 - 4.8, 5.1
Wed Oct 24 Partially Ordered Sets 6.1 (HW: # 1-17 odd)
Mon Oct 29 Extremal Elements of Partially Ordered Sets
Quiz 6
6.2 (HW: # 1-17 odd, 21-31 odd)
5.2, 5.3, 6.1
Wed Oct 31 Lattices 6.3 (HW: # 1-7 odd, 17)
MON Nov 5 Finite Boolean Algebras
Quiz 7
LAST DAY TO DROP A CLASS
AND RECEIVE A "W"
6.4 (HW: # 1-11 odd, 27-31 odd)
6.2, 6.3


Wed Nov 7 Functions on Boolean Algebras
Circuit Designs
6.5 (HW: # 1-13 odd)
6.6 (HW: # 1-23 odd)
MON Nov 12 EXAM 2 On the material
covered since Exam 1
Wed Nov 14 Trees 7.1 (HW: # 1-21 odd)
Mon Nov 19 Labeled Trees
Quiz 8
7.2 (HW: # 1-19 odd)
6.6
Wed Nov 21 No class
(Wed, 11/21, follows a Friday class schedule)
Mon Nov 26 Tree Searching 7.3 (HW: # 1-25 odd)
Wed Nov 28 Languages
Quiz 9
10.1 (HW: # 1-25 odd)
7.1 - 7.3
Mon Dec 3 Representation of Special Grammars
Regular Expressions
10.2 (HW: 1-17 odd)
1.3 (HW: 31,33,35)
Wed Dec 5 Finite-State Machines
Monoids, Machines and Languages
Quiz 10
10.3 (HW 1-13 odd)
10.4 (HW: 1-19 odd)
10.1, 10.2
Mon Dec 10 Machines and Regular Languages 10.5 (HW: 1-23 odd)
Wed Dec 12 Review for the Final Exam
Quiz 11
-
1.3, 10.3 - 10.5
WED DEC 19 FINAL EXAM
8:30-11:30am

Smith 241
The final is
comprehensive, but
will emphasize the
material since Exam 2


John Loftin 2007-08-28