Instructor: Dr. William H. Winsborough
Office: HSS 4.02.52
Phone: (210) 458-5659
Email Address: winsboro at cs dot utsa dot edu
Course Homepage: http://www.cs.utsa.edu/~winsboro/teaching/CS3233F2005/
Office Hours: MW 3:15 - 4:15pm; F 12:45 - 1:45pm
Class Times: MWF 2:00 - 2:50pm in room HSS 3.02.50
Recitation Times:

Text: Discrete Mathematics and Its Applications, Fifth 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, functions, and relations
• Mathematical proof techniques, including proof by induction
• Techniques for specifying and analyzing algorithms
• Introduction to discrete probability
• Introduction to graph theory and trees
• Finite automata

• 20% Each of two Midterm Exams
• 25% Assignments (Recitation assignments and problem sets)
  
• 35% Final Exam (Friday, December 9, 7:30 - 10:15 am)
  

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. There will be a 10 percent penalty for assignments turned in after that time. Do not miss class to finish an assignment. Turn in what you have for partial credit. Assignments that are more than 24 hours late will not be accepted unless prior arrangements have been made.

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 to 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 are likely to be considered to be cheating.

• Week of 8/22 (2 lectures)
  Sections 1.1, 1.2: Logic and Propositions
• Week of 8/29 (3 lectures)
  Sections 1.3, 1.4, 1.5: Predicates, Quantifiers, and Methods of Proof
• Week of 9/5 (2 lectures)
  Sections 1.6, 1.7, 1.8: Sets, Set Operations, and Functions
• Week of 9/12 (3 lectures)
  Sections 2.1, 2.2, 2.3: Algorithms and Complexity
• Week of 9/19 (3 lectures)
  Sections 2.4, 2.5, 2.6, 2.7: Integers and Algorithms, Applications, and Matricies
• Week of 9/26 (1-3 lectures--number TBA)
  Winsborough out of town 9/26-27, 9/29-30
  Sections 3.1, 3.2: Proofs, Sequences, and Sums
• Week of 10/3 (1 lecture, 1 review session, 1 midterm 10/7)
  Section 3.3: Mathematical Induction
• Week of 10/10 (2 lectures, 1 discussion of exam results)
  Sections 3.4, 3.5, 6.1 : Recursion, Structural Induction, and Recurance Relations
• Week of 10/17 (3 lectures)
  Sections 3.6, 4.1, 4.2, 4.3: Program Correctness, Counting, Permutations, and Combinations
• Week of 10/24 (3 lectures)
  Drop deadline 10/25
  Sections 5.1, 5.2, 5.3: Discrete Probability, Expected Value, and Independent Events
• Week of 10/31 (3 lectures)
  Sections 7.1, 7.2, 7.3, 7.4: Relations, Representation, and Closure
• Week of 11/7 (2 review sessions, 1 midterm 11/11)
  Winsborough out of town 11/8-11
• Week of 11/14 (2 lectures, 1 discussion of exam results)
  Section 7.5, 7.6, 8.1: Equivalence Relations, Orderings, Well-Ordered Induction, and Graphs
• Week of 11/21 (2 lectures, Thanksgiving)
  Sections 8.2, 8.3, 8.4: Graphs, Representation, Isomorphism, and Connectivity
• Week of 11/28 (3 lectures)
  Sections 9.1, 9.2, 9.3: Trees and Tree Traversal
• Week of 12/5 (Final exam, 12/9 7:30-10:15am)