Course Schedule, Discrete Structures, Spring 2006

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

1.1 (HW: # 1-17 odd)
1.2 (HW: # 1-19 odd)
MON Jan 23 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 Jan 24 LAST DAY TO ADD A CLASS
Wed Jan 25 The Euclidean Algorithm
Matrices
Quiz 1
1.4
1.5 (HW: # 1-13 odd, 31, 33)
1.1 - 1.4
Mon Jan 30 Matrices
Mathematical Structures
1.5
1.6 (HW: # 1-23 odd)
Wed Feb 1 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 Feb 6 Permutations
Combinations
3.1 (HW: # 1-15 odd)
3.2 (HW: # 1-15 odd)
Wed Feb 8 Elements of Probabability
Recurrence Relations
Quiz 3
3.4 (HW: # 1-15 odd, 31-35 odd)
3.5 (HW: # 1-17 odd)
2.1, 2.2, 2.4, 3.1
Mon Feb 13 Product Sets and Partitions
Relations and Digraphs
4.1 (HW: # 1-17 odd)
4.2 (HW: # 1-25 odd)
Wed Feb 15 Paths in Relations and Digraphs
Properties of Relations
4.3 (HW: # 1-19 odd, 27)
4.4 (HW: # 1-25 odd)
MON Feb 20 EXAM 1 On the material
covered to date:
(up to 4.3; no 4.4 on test)
Wed Feb 22 Equivalence Relations
Computer Representations of Relations and Digraphs
4.5 (HW: # 1-13 odd)
4.6 (HW: # 5-9 odd)
Mon Feb 27 Operations on Relations
Transitive Closure and Warshall's Algorithm
Quiz 4
4.7 (HW: # 1-23 odd)
4.8 (HW: # 1-15 odd)
4.4 - 4.6
Wed Mar 1 Functions 5.1 (HW: # 1-17 odd)
Mon Mar 6 Functions for Computer Science
Growth of Functions
Quiz 5
5.2 (HW: # 1-11 odd)
5.3 (HW: # 1-21 odd)
4.7, 4.8, 5.1
Wed Mar 8 Partially Ordered Sets 6.1 (HW: # 1-17 odd)
Mon,Wed Mar 13,15 SPRING BREAK
Mon Mar 20 Extremal Elements of Partially Ordered Sets
Quiz 6
6.2 (HW: # 1-17 odd, 21-31 odd)
5.2, 5.3, 6.1 (1-7 odd only)
Wed Mar 22 Lattices 6.3 (HW: # 1-7 odd, 17)
MON Mar 27 Finite Boolean Algebras
Quiz 7
LAST DAY TO DROP A CLASS
AND RECEIVE A "W"
6.4 (HW: # 1-11 odd, 23-31 odd)
6.1 (9-17 odd), 6.2, 6.3


Wed Mar 29 Functions on Boolean Algebras
Circuit Designs
6.5 (HW: # 1-9 odd)
6.6 (HW: # 1-23 odd)
MON Apr 3 EXAM 2 On the material
covered since Exam 1
Wed Apr 5 Trees 7.1 (HW: # 1-21 odd)
Mon Apr 10 Labeled Trees
Quiz 8
7.2 (HW: # 1-19 odd)
7.1
Wed Apr 12 Tree Searching 7.3 (HW: # 1-19 odd)
Mon Apr 17 Languages
Quiz 9
10.1 (HW: # 1-25 odd)
7.2 - 7.3
Wed Apr 19 Representation of Special Grammars
Regular Expressions
10.2 (HW: 1-19 odd)
1.3 (HW: 31,33,35)
Mon Apr 24 Finite-State Machines
Monoids, Machines and Languages
Quiz 10
10.3 (HW 1-15 odd)
10.4 (HW: 1-19 odd)
1.3, 10.1, 10.2
Wed Apr 26 Machines and Regular Languages 10.5 (HW: 1-23 odd)
Mon May 1 Review for the Final Exam
Quiz 11
-
10.3 - 10.5
Mon May 8 FINAL EXAM, 3-6pm
Smith 243
The final is
comprehensive, but
will emphasize the
material since Exam 2


John Loftin 2006-01-11