CS 2233 Discrete Mathematical Structures
Fall 09

[ Home | Calender | Policies | Pictures | Homework | Resources ]

Calender

Homework Assignments, Exams, and Tentative Topics


Monday Wednesday Friday
  August 26
§1.1 Propositional Logic
R: Misc practice
August 28
§1.2 Propositional Equivalences
R: Misc practice
August 31
§1.3 Predicates and Quantifiers
HW #1 assigned
September 2
§1.4, Nested Quantifiers
R: Practice for HW #1
September 4
§1.6 Introduction to Proofs
R: Practice for HW #1
September 7
Labor Day
September 9
§1.7 Proof Methods and Strategy
HW #2 assigned
HW #1 due
R: Practice for HW #2
September 11
Catchup §1
R: Practice for HW #2
September 14
§2.1 Sets
HW #3 assigned
September 16
§ 2.2 Set Operations
HW #2 due
R: Practice for HW #3
September 18
§2.3 Functions
R: Practice for HW #3
September 21
§2.3 Functions
September 23
§2.4 Sequences and Summations
HW #3 due
R: Practice for Midterm 1
September 25
§3.1-3.3 Algorithms and Complexity
R: Practice for Midterm 1
September 28
Midterm 1
September 30
§3.1-3.3 Algorithms and Complexity
R: Midterm 1 results
October 2
§3.1-3.3 Algorithms and Complexity
R: Midterm 1 results
October 5
§4.1 Mathematical Induction
HW #4 assigned
October 7
§4.1 Mathematical Induction
R: Practice for HW #4
October 9
§4.2 Strong Induction and Well-Ordering
R: Practice for HW #4
October 12
§4.5 Program Correctness
HW #5 assigned
October 14
§4.3, §4.4, §7.1 Recursive Definitions and Algorithms, and Recurrence Relations
HW #4 due
R: Practice for HW #5
October 16
§4.3, §4.4, §7.1 Recursive Definitions and Algorithms, and Recurrence Relations
R: Practice for HW #5
October 19
§4.3 Structural Induction
HW #6 assigned
October 21
§7.3 Divide-and-Conquer Algorithms, Recursion Trees, Induction
HW #5 due
R: Practice for HW #6
October 23
§7.3 Divide-and-Conquer Algorithms, Recursion Trees, Induction
R: Practice for HW #6
October 26
No class
October 28
§7.3 Master Theorem
HW #6 due
R: Practice for Midterm 2
Thursday October 29: Automatic 'W' drop deadline
October 30
§7.3 Master Theorem
R: Practice for Midterm 2
November 2
Midterm 2
November 4
7.2 Solving Linear Recurrences
R: Midterm 2 results
November 6
7.2 Solving Linear Recurrences
R: Midterm 2 results
November 9
§8.1 Relations
HW #7 assigned
November 11
§8.1, 8.2 Relations
R: Practice for HW #7
November 13
§8.5 Equivalence Relations
R: Practice for HW #7
November 16
§9.1 Graphs
HW #8 assigned
November 18
§9.2, 9.3 Representing Graphs
HW #7 due
R: Practice for HW #8
November 20
§10.1 Introduction to Trees
R: Practice for HW #8
November 23
§10.1 Introduction to Trees
HW #9 assigned
November 25
§12.1 Languages and Grammars
HW #8 due
R: No recitation
November 27
Thanksgiving
 
November 30
§12.1 Languages and Grammars
December 2
§12.3 Finite-State Machines
R: Practice for Final
December 4
Final exam review
HW #9 due
R: Practice for Final

Final exam: Friday December 11, 7:30am - 10am


Last modified by Carola Wenk,   carola @ cs.utsa.edu ,