Instructor: Dr. William H. Winsborough
Office: SB 4.01.26
Phone: 458-5659
Email Address: winsboro at cs dot utsa dot edu
Course Homepage: http://www.cs.utsa.edu/~winsboro/teaching/CS3233F2007/
Office Hours: TR 4:00 - 5:00pm SB 4.01.26 and by appointment
Class Times: TR 12:30 - 1:45pm MS 2.02.12
Recitation Time: T 2:00 - 2:50pm SB 3.02.10A

Text: Discrete Mathematics and Its Applications, Sixth Edition by Kenneth H. Rosen

Prerequisites: CS 1721, CS 1723, and MAT 1223. Concurrent enrollment in CS 3231 is required.

• Propositional and predicate calculus
• Basic set theory and functions
• Mathematical proof
• Techniques for specifying and analyzing algorithms
• Induction and recurision
• Introduction to discrete probability and counting
• Introduction to relations
• Introduction to graph theory and trees

• 20% Each of two Midterm Exams
• 20% Homework Assignments
  
• 5% Attendance
• 35% Final Exam (Wednesday, December 5, 10:30am - 1:00pm)
  

No make-up exams will be given, except for university sanctioned, excused absences. If you must miss an exam (for a good reason), it is your responsibility to contact me as far before the exam as possible. In most cases, you must talk to me several weeks before the exam for the absence to be excused. At minimum, you must leave a message at the above number or send me email. If it is my judgement that this message should have come earlier, the grade for that exam will be a zero. If a make-up exam is given, it may be harder than the regular exam.

Unless otherwise stated, all assignments are due at the beginning of class on the due date. assignments turned in after that time will usually receive a zero unless prior arrangements have been made. Do not miss class to finish an assignment. Turn in what you have for partial credit.

You must write your solutions to the assignments by yourself and without help from anyone. If you have questions, see me (or the TA, if I'm not available). Until the final deadline for submitting an assignment, you may not discuss those problems with anyone else, unless I give you explicit permission to do so. However, after an assignment can no longer be turned in for credit by any student involved in the discussion, you are strongly encouraged to discuss the problems in that assignment and to compare your solutions with those of other students. This can be an important opportunity to prepare for exams. Scholastic dishonesty will be treated harshly. Cheaters, including students who assist others cheat, can expect to receive a failing grade and to be reported to the University for possible further disciplinary action. Students who hand in problem solutions that are identical or nearly identical will likely be considered to be cheating.

• Week of 8/20 (1 lecture)
  Sections 1.1, 1.2
  Logic and Propositions
• Week of 8/27 (2 lectures)
  Sections 1.3, 1.4
  Propositions, Predicates, and Quantifiers
• Week of 9/3 (2 lectures)
  Sections 1.5, 1.6, 1.7
  Rules of Inference, Methods of Proof
• Week of 9/10 (2 lectures)
  Sections 2.1, 2.2, 2.3
  Sets and Set Operations, Functions
• Week of 9/17 (2 lectures)
  Sections 2.4, 3.1, 3.2
  Sequences and Sums, Algorithms, and Growth of Functions
• Week of 9/24 (2 lectures)
  Sections 3.3
  Complexity of Algorithms
• Week of 10/1 (1 lecture, 1 midterm 10/4)
  Catch up and Review
• Week of 10/8 (2 lectures)
  Sections 4.1, 4.2
  Mathematical Induction, Strong Induction, and Well-Ordering
• Week of 10/15 (2 lectures)
  Sections 4.3, 4.4
  Recursive Definitions, Structural Induction, Recurisve Algorithms
• Week of 10/22 (2 lectures)
  Sections 5.1, 5.2, 5.3
  Counting, Permutations and Combinations
• Week of 10/29 (2 lectures)
  Winsborough out of town 10/29-11/2
  Sections 6.1, 6.2, 6.3, 6.4
  Discrete Probability, Expected Value, and Independent Events
• Week of 11/5 (1 lecture, 1 midterm 11/8)
  Catch up and Review
• Week of 11/12 (2 lecture)
  Sections 7.1, 7.2, 7.3
  Recurance Relations and Divide-and-Conquer Algorithms
• Week of 11/19 (1 lecture, Thanksgiving)
  Section 8.1, 8.2, 8.5, 8.6
  Relations, Equivalence Relations, Partial Orderings
• Week of 11/26 (2 lectures)
  Sections 9.1, 9.2, 10.1
  Graphs and Trees
• Week of 12/3
  Final exam, Wednesday 12/5 10:30am-1:00pm