CS 3233 Discrete Mathematical Structures

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

Calender

Homework Assignments, Exams, and Tentative Topics


Monday Wednesday
  August 25
 
§1.1-2 Introduction & Logic
August 30
#1 assigned
§1.3-4 Predicates and Quantifiers
September 1
 
§1.5, § 3.1 Methods of Proof
September 6
 
Labor day
September 8
#1 due; #2 assigned
§1.6-8 Sets, Functions
September 13
#3 assigned
§2.1-3 Algorithms & Complexity
September 15
 
§ 2.1-3 Algorithms & Complexity
September 20
#2 due
§2.4-5 Integers & Algorithms
September 22
#4 assigned
§ 2.6-7 Applications & Matrices
September 27
#3 due
§3.2-3 Sums, Sequences, & Math. Induction
September 29

§3.3 Mathematical Induction
October 4
#4 due
Midterm 1 review
October 6
 
Midterm 1
October 11
#5 assigned
Midterm 1 Results
October 13
 
§3.4-5, §6.1 Recursion
October 18
#6 assigned
§4.1-2 Counting & Pigeonhole Principle
October 20
#5 due
§4.3-4 Permutations and Combinations
October 25
#7 assigned
§5.1-2 Discrete Probability
October 27
#6 due
§5.3 Expected Value and Independency
November 1
#8 assigned
§7.1 Relations
November 3
#7 due
§7.2,4,5,6 Types of Relations
November 8
 
Midterm 2 review
November 10
 
Midterm 2
November 15
#9 assigned
Midterm 2 Results
November 17
#8 due
§8.1-3, § 7.3 Graphs
November 22
#10 assigned
§8.4, 9.1 Paths, Connectivity, & Trees
November 24
#9 due
§9.3,4 Tree and Graph Traversal
November 29
 
§11.3 Finite State Automata
December 1
#10 due
Final exam review

Final exam: Friday December 10, 1:30pm - 4:15 pm


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